(6) Binary Search: Split Array Largest Sum

Question Link and Solution Link Difficulty: Hard Problem Statement: Given an array of elements you need to split it into m subarrays such that the maximum sum of the subarray is minimized. Approach: Let mid be the maximum sum a particular sub-arra...