Split Array Largest Sum

Question Explain

Given an array `nums` and an integer $k$, split `nums` into $k$ non-empty contiguous subarrays such that the largest sum among these $k$ subarrays is minimized. Use Binary Search on the answer.