Split Array Largest Sum | Leetcode 410 | Range Based Binary Search 🔥🔥 | Live coding session

Here is the solution to "Split Array Largest Sum" leetcode question. Hope you have a great time going through it.

👉 Solutions

🔥🔥🔥🔥👇👇👇 For discussion/feedback/humour/doubts/new openings

🔴 Checkout the series: 🔥🔥🔥

🔥🔥🔥 Leetcode Monthly Contest Playlist

PS : Please increase the speed to 1.25X

[VinayKumar-xsel]

line 33 can directly assign current num to totalRunningSum

[vskmahindrakar]

This ls some what similar to book allocation, painter partition ans aggressive cow problem

[actualmushrooms]

what is time and space complexity? is it TC : O(nlogn) and SC : O(logn) ?

[nicolattu]

Genius ! I thought this one was going to be dp in ranges but couldn't solve today 😕
Apart from that I see most people on leetcode do binary search with:
mid = left + (right-left)/2
But I find it easier to do
mid = (left + right) / 2
Thanks for the video, and please keep it up 💯

[zero-wb]

in this question why are we doing high=mid why not high = mid-1. can someone explain

[neuron]

bro why you add all hard que to medium have some mercy on us

[priyadarshanr]

Can you explain why you chose low=10 initially ? And I feel this to ne hard coz I was not able to think of a binsary search approach here coz the array is undsorted in nature .