Split Array Largest Sum with Python

Question: Split Array Largest Sum
Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized.
Return the minimized largest sum of the split.
A subarray is a contiguous part of the array.

Approach: Binary Search
We perform binary search to find the minimum possible maximum subarray sum when splitting the given array into k subarrays. Verify if it's possible to split the array with a maximum sum less than or equal to a given mid.

Time Complexity: O(n * log(nums))
Space Complexity: O(1)