Max Chunks To Make Sorted - Leetcode 769 - Python

[@mechano6505]

Half the difficulty of this problem is just understanding wtf it's asking

[@josuemartinez3682]

fr, was hella lost

[@PanicAtProduction]

Thank you for critizing leetcode’s English. It makes two times harder a regular question. Question is harder than solution many times.

[@devkumar9889]

My logic was simple, if 4 is at 0th index then what it is doing there It should have been at 4th index so it means that we got single chunk from [0,4] But all items in range [0,4] should be in range [0,4] If any item x > [0,4] then new range becomes [0, x] And this range expansion continues till we get a range where all items are within that range So keep iterating from i to max where initially max = arr[i] and this will make sure that x > [s,e] then max updates to x and we keep iterating till x and hence we found 1 chunk

[@MP-ny3ep]

Very beautifully explained. Thank you. Missed your videos for a while there.

[@RupeshPatel-ry6jb]

Hey Neetcode, I am your pro subscriber. when are you going to release object oriented programming course?

[@user-my6yf1st8z]

brilliant

[@VictoriaJames-i9j]

Well coded, thank you! I want to ask unrelated question, I have a okx wallet with USDT, and I have the seed phrase: (hollow sound same mercy asthma property exchange topple buddy need vault foster).What's the best method to send them to Binance?

[@mehdiamiri5418]

hi, is there any way I can contact you?