Leetcode #410 - Split Array Largest Sum [Hard]

Our instructor Zedd walks us through a brute-force solution to one of the more evasive 'Hard' rank leetcode questions.

Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.

Link to the actual problem

Let us know what you think in the comments!