Partition Array into Disjoint Intervals | Leetcode 915 | Live coding session 🔥🔥🔥

Here is the solution to "Partition Array into Disjoint Intervals" leetcode question. Hope you have a great time going through it.

Chapters
1) 0:00 Explaining the problem out loud
2) 1:10 Question walkthrough
3) 2:00 Building the SC O(n) algorithm
4) 2:00 Building the SC O(1) algorithm
5) 10:00 Coding it up

For discussion/feedback

PS : Please increase the speed to 1.25X

[jabedhasan]

You explain every problem in a very decent way. Thank you so much.

[vishistsd]

I could never think of O(1) space by myself, Thanks.

[priyadarshanr]

We owe you so much, Thank you so much for your time and efforts

[sakshamsengar]

bhai dil jeet lia op solution
please explain in more detail unique approach like this in the last

[santoshvarma]

I could come with first approach but second was great. thanks for your time.

[rohitpal]

can anyone tell what kind of approach is used here ? Is it a two pointer approach ??

[tanson]

I am still not understanding the question completely, for example for this i/p array [1, 1, 1, 0, 6, 12] the expected answer is [1, 1, 1, 0] [6, 12]. But isn't the following also meeting all constraints - [1, 1, 1, 0, 6] [12]

[tejassudhirtapas]

Can you please tell in the method 1 why we are going from right to left to find minimum array
might be a very silly doubt but I am not understanding the logic

[jainneeraj]

The local maxima concept was not intuitive at you can't come up with mugged up answers in an interview without proper explanation.