Max Chunks To Make Array Sorted | Arrays & Strings | Leetcode 769 Solution in Hindi

[@amanbabu5138]

I saw many programming tutorial but the level of explanation of shreesh sir is far better than anyone. so sir keep going we are with you. Dil se huge respect sir

[@Pepcoding]

Glad it was helpful! Keep learning. And for better experience, visit nados.io, where you will get well curated content and career opportunities.

[@pawandeepchor89]

You guys are the real heros of KZbin ... Thankyou keep going strong 💪

[@satyamjaiswal5251]

Excellent explanation shreesh sir is gem of youtube

[@anshikaagrawal727]

explanation is more than enough ....solution tak jane ki jarurat hi nhi h

[@codeblooded6760]

Amazing Technique!!

[@shreeshtripathi8082]

Stay motivated, and keep learning :)

[@shreysom2060]

Mast expaination wow thankyou

[@MANNUMAHESH1]

Really good explanation bro. Thanks a lot 🙂

[@poojaraychaudhuri593]

Very well explained

[@Pepcoding]

Glad it was helpful! For better experience check out nados.pepcoding.com

[@rkalpeshk]

Thanks PepCoding

[@sahazeerks2363]

Awesome solution, why this is called chaining technique ? could you please share list of related problems

[@gorakhkumargupta491]

Well explained

[@Pepcoding]

Glad you love the explanation, for better experience and well curated content sign up on nados.io and start learning.

[@jasmeenkaur6001]

thank you

[@CodingAbhay]

Superb

[@037_sayedramishali7]

Sir aisa laga ki seedha solution bta diya intuition nhi mila bilkul

[@HarendraKumar-hl8nh]

Dear SAYED, Most important think that you should care about all time is we have to make continuous paritions (chunks) so that if we sort those continuous parition then this should result in sorting the overall array. So, logic is clear, to sort the overall array ,every element wants to go to their original position that is its index position itself ( 0 wants to be on 0 th index, 1 wants to be on 1st index...and so on ) , so this technique is working in similar way as it ask every element that where it wants to go... and those element whose desire is maximum index then we would consider that elements as one chunk because we already know that inside my chunk rest of the element's desire position are not more than those of maximum index. so if we sort by considering the maximum index as one chunk then rest of the element inside the chunk will definetly go to their position . And this will result in sorting the whole array. Happy coding.

[@atharvakulkarni2024]

Sir, the last case that you have shown is wrong in that though u make the chunk u cant makr the array sorted.Please check

[@utkarshsinghchouhan8819]

😃😀

[@priyanshgarg1292]

nice

[@pratikjha2742]

sir wht if the chunks overlap like in 5612304

[@akashtyagi9326]

then whole array will be our chunk so, the answer will be 1

[@letsdoeverythinginoneweek9398]

isma max update hoga esa ki usa kabhi koi max mill nahi paayega max=Math.max(arr[i],max) vali condition deko broooooo 1 chunk banega

[@Mrdynamics365]

can we take some randow values....

[@azeemali6865]

Can anyone explain the First statement of the Question

[@martymcfly9539]

what is the logic behind this chaining technique how does one think of this?

[@HarendraKumar-hl8nh]

Dear Marty, Most important think that you should care about all time is we have to make continuous paritions (chunks) so that if we sort those continuous parition then this should result in sorting the overall array. So, logic is clear, to sort the overall array ,every element wants to go to their original position that is its index position itself ( 0 wants to be on 0 th index, 1 wants to be on 1st index...and so on ) , so this technique is working in similar way as it ask every element that where it wants to go... and those element whose desire is maximum index then we would consider that elements as one chunk because we already know that inside my chunk rest of the element's desire position are not more than those of maximum index. so if we sort by considering the maximum index as one chunk then rest of the element inside the chunk will definetly go to their position . And this will result in sorting the whole array. Happy coding.

[@mickyman753]

just one thing ,max of the chunk when reaches it index then it marks end of that chunk

[@siddharth7261]

@@HarendraKumar-hl8nh Thanks Bro

[@siddharth7261]

@@mickyman753 Yup

[@learnwithme8936]

you logic fail for test case [1,2,0,3] your logic give answer 3 but it must be 2

[@ruchitachandel2348]

Ek aur sunhara mauka chunk count bhadne ka !!!! hahahaha....

[@gautamarora6556]

Awesome Technique!!

[@shreeshtripathi8082]

Stay motivated, and keep learning :)

[@gautamarora6556]

@@shreeshtripathi8082 Sir please make more videos on leetcode problems, please sir.

[@shreeshtripathi8082]

@@gautamarora6556 we are on way, stay tuned. :)