Max Chunks To Make Array Sorted - 2 | Arrays & Strings | Leetcode 768 Solution in Hindi

Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. 1. Given an array arr of integers (not necessarily distinct).
2. We split the array into some number of "chunks" (partitions), and individually sort each chunk.
3. After concatenating them, the result equals the sorted array.
4. What is the most number of chunks we could have made?
Topic: #Arrays #Leftmax #Rightmin #DP
Used #DataStructure: #Arrays
#TimeComplexity: O(n)
#SpaceComplexity: O(n)
--------------------------------------------------------------
Linked Questions:
1. Max Chunks To Make Array Sorted :
---------------------------------------------------------------
For detailed information and other exercises, VISIT: www.pepcoding.com
Have a look at our result: www.pepcoding....
Follow us on our FB page: / pepcoding​
Follow us on Instagram: / pepcoding​
Follow us on LinkedIn: / pepcoding-education
----------------------------------------------------------------
#pepcoding, #leetcode, #gfg, #maxChunks, #leftmax, #rightmin, #chaining, #leetcode768, #768leetcode #hindiSolution #hindi #java
For a better experience and more exercises, VISIT: www.pepcoding.....
Have a look at our result:
Follow us on our KZbin page: / pepcoding
Follow us on our FB page: / pepcoding
Follow us on Instagram: / pepcoding
Follow us on LinkedIn: / pepcoding-education
Follow us on Pinterest: / _created
Follow us on Twitter: home
.
.
.
Happy Programming !!! Pep it up 😍🤩
.
.
.
#pepcoding #code #coder #codinglife #programming #coding #java #freeresources #datastrucutres #pepcode #competitive #competitiveprogramming #softwareengineer #engineering #engineer

[@rahulsati5819]

this channel deserves 1 million subscribers

[@amriteshsingh2952]

The complete playlist is awesome in terms of quality of questions and their explanation. Thanks a lot for all your efforts.

[@abhiroopmokshagnabheemineni]

Wow.. Just awesome approach. I would have never thought of it!!

[@sakshamp4488]

Love your unique and smart ways of solving problems. i was able to this on my own, but i got stuck with test cases with duplicate values,then i was able to pass all t.c on leetcode but it wasn't the best /optimized soln. after some time

[@shubhamrao7100]

We are loving your playlist..please increase the frequency of uploading the questions

[@Pepcoding]

Sure I will

[@arslanali-vi5nj]

sir kamal kr dya hn ap ny itna acha kon samjata hn wo b hindi main ? nice

[@riamonga2283]

Great vid!! 🙌🙌

[@sakshigandhi4714]

great work..God bless!!

[@rajeshbiswas755]

Great solution. Kind of the same as the rain tap solution.

[@Gggggg172eyeyeurhuwue]

Quality videos!

[@faizan346]

please state in the question itself from next time what complexity should we have to do. as the constraint are very loose. i did it in nlogn, dissappointment on my side. but the solution is so good thanks for that.

[@sushantbhosale5792]

Awesome Explanation Thanks Sir !!!

[@ashutoshhans]

How to think these types of solution ? Will it come with learning and recognising patterns ? Btw, This is great video.

[@HimanshuSharma-ne3oh]

maje aagye bhaiya

[@KurumiddeKezia]

Super❤

[@ritusundaram4070]

Suuperrr explaination........that why I I like pepcoding a lot 🔥🔥

[@avinash-xh6qw]

thanku

[@LegitGamer2345]

that was smart

[@Pepcoding]

Thank you so much and If you like our efforts, please upvote the comments written by the students about Pepcoding here (www.quora.com/What-are-the-good-websites-to-learn-data-structures-and-algorithms )

[@codingwithanonymous890]

how to build this type of intuitions

[@buu4504]

nic we could also do it by making new array and equating it with the given one ,sorting the new array and precomputing the sum(prefix array) of both and at any point if arr[i]==new_arr[i] we do chunks++

[@Pepcoding]

For better experience and precisely arranged videos. Visit - nados.pepcoding.com and sign up to NADOS. Don't forget to follow us on Instagram instagram.com/pepcoding/

[@mohdmudassir3548]

can't we do like this. first calculate the index of next greater element for all elment in O(n). now you have the range and proceed further

[@udaypratapsingh8923]

no it may be possible that after the next greater element there is smaller element ..

[@ROHITKADYANJI]

Comes in JTG

[@aahanaganjewar9951]

Can anyone explain me why of this question?

[@saunaknandi1814]

Is not this a greedy approach

[@letsdoeverythinginoneweek9398]

bhaiya yaha pa samaj nahi aaya aapna right min araya banaya ha arr.lenmgth+1 ka but aap max value store kar raha ho arr.length pa

[@keshavbansal6962]

kyuki usse left max kha tk calculate krna hai ek chunk complete krne ke liye yeh right min ke i+1 value se pta chlega baaki dry run se clear hojayega

[@mickyman753]

last ele pr ek chunk end hoga hi hoga so we need to check/consider it separately

[@nitishgoyal9910]

Sir, placements ke liye pehle FAANG list karni chaiye ya leetcode list ?

[@shang_chi4651]

What's that leetcode list? Can you provide me the link to that, please🙏. I have heard about faang list but not about leetcode list

[@pulkit2484]

@@shang_chi4651 its below faang list on pepcoding resource page

[@mickyman753]

@@pulkit2484 wo toh faanglist 2.0 hai ,usi ki baat kr rhe ho na

[@pulkit2484]

@@mickyman753 yep yep