Problem 410 · Hard
Split array into m subarrays minimizing the largest subarray sum using binary search.
Open the interactive visualisation