**Problem Statement:**
Given the required input arguments, write an efficient algorithm to solve the **Split Array Largest Sum** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge.
**Hint / Expected Approach:**
Binary search on answer + greedy split check
**Edge Cases to Consider:**
- (1) k = 1
- (2) k = n
- (3) All equal elements
Examples
Example 1
Input:[7,2,5,10,8], 2
Output:18
Explanation: [7,2,5],[10,8] → max=18
Example 2
Input:[1,2,3,4,5], 2
Output:9
Explanation: [1,2,3],[4,5] or [1,2,3,4],[5] → max(6,9)=9 → `9`