Q.1 Given an array of integers and a number m. We can create m subarrays using the input array. The max sum of each subarrays out of each possibilities are taken. Return the minimum number out of them.\n\nEg: [1 3 9 2 7 8]\nm=2\n\nPossibilities------Sum---Max\n[1] [3 9 3 7 8]--- 1, 30----30\n[1 3][ 9 2 7 8]--- 4, 27----27\n[1 3 9][ 2 7 8]---13, 17----17\n[1 3 9 2][ 7 8]---15, 15----15 \n[1 3 9 2 7][ 8]---22, 8----22\n\nans: 15 (as 15 is min of the all maximum sums)\n\nHINT: overlapping problem\n\nI couldn\'t come up with the solution. Please if anyone has some approach please let know. Also, if anybody couldn\'t get the question please let me know through comments I will try to improvise it.\n\nEdits: Array can contain negitives also. _Binary search solution won\'t work in that case_

Q.1 Given an array of integers and a number m. We can create m subarrays using the input array. The max sum of each subarrays out of each possibilities are take