GoLang Solution For LeetCode Problem: Split Array Largest Sum
Solving Split Array Largest Sum in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Input: nums = [7,2,5,10,8] m = 2 Output: 18 Explanation: There are four ways to split nums into two subarrays. The best way is to split it into [7,2,5] and [10,8], where the largest sum among the two subarrays is only 18.
See the full details of the problem Split Array Largest Sum at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go