Dutch National Flag problem leetcode

#competitiveprogramming #leetcode #coding
This video is about how to approach a competitive programming problem starting from a naive approach to an optimal solution.
This is the Leetcode problem which is solved in three different solutions.
Problem link: leetcode.com/problems/sort-co...
GitHub link for Java and Kotlin solutions: bit.ly/3475EY6
For written content,
check out the blogger website: engineer-sunny.blogspot.com
Instagram: / engineerhooon
LinkedIn: / sunny-shaw
Medium: / sunnyshaw_12357
GitHub: github.com/sunny-shaw

[@sktime6538]

space complexity of merge sort is O(n) right ?

[@Engineerhooon]

Yes, Thanks for pointing it out. I will pin your comment.

[@ashelytang2592]

Short and to the point. This was great, thank you!!

[@Engineerhooon]

Glad you find it helpful 🙌

[@jankipatel118]

awesome explanation , carry on sir, waiting for new problems

[@Engineerhooon]

Thanks! More videos coming soon. Do checkout the playlist for more videos.

[@anukritisingh7204]

Best video ever regarding dutch flag algo! Thanks for the explanation!

[@Engineerhooon]

Thanks!

[@aravindpogu]

Thanks for the explanation. This solution approach could be also used for problems like below: Given an array of ages, segregate them into 3 groups ( kid), (18-59 adult,) (>=60 senior)

[@Engineerhooon]

Yes

[@mogilipoojitha3039]

great explanation .Thank you..

[@Engineerhooon]

Thank you!

[@bcyourself]

This is such an excellent explanation! Thank you so much!!!!

[@Engineerhooon]

Welcome!

[@emmagraham1]

I watched 1000 videos on this and this one is the only one that helped. Thank you.

[@Engineerhooon]

Thank you! It means a lot.

[@tvsnath]

Thanks for the awesome explanation..

[@Engineerhooon]

You're welcome!

[@Jawahar-Engr.]

Understood the algorithm , Thank you so much. Greatly helpful

[@Engineerhooon]

Glad it helped!

[@bishwashkumarsah171]

nice explanation brother

[@Engineerhooon]

Thanks brother!

[@Jawahar-Engr.]

Please upload video based on sub array problem.. Like sub array with given sum, sliding window..

[@Engineerhooon]

I have a few videos on these topics as well. Checkout the playlist here : kzbin.info/aero/PLF5kUO89mjNpe29aZH6quaqfms9GDaUnO

[@satyavarmalutukurthi]

Great explanation.....

[@Engineerhooon]

Glad it was helpful. Many more to come.

[@chandravijaya1410]

Thank you

[@Engineerhooon]

Welcome!

[@bhawnakumari7894]

Good explanation!

[@Engineerhooon]

Thanks Bhawna.

[@sarithanaik2321]

Thank you so much ... helped a lot

[@Engineerhooon]

You're welcome!

[@ashutoshrai2717]

Your explanation with figure is amazing

[@Engineerhooon]

Noted. Will follow same for future videos. ✔

[@ashutoshrai2717]

@@Engineerhooon please bring some more videos on questions like sorting and searching algorithms it will really help

[@Engineerhooon]

@@ashutoshrai2717 Noted :)

[@ashutoshrai2717]

Very good explanation 👍👍

[@Engineerhooon]

Thanks!

[@satyavarmalutukurthi]

Subscribed...

[@Engineerhooon]

Thanks! Please share with others for better reach.

[@getsunova8894]

Excellent explanation for an overly complicated algorithm.

[@Engineerhooon]

Thank you!

[@agnelamodia]

space complexity for Approach 2 is O (n) as we are using auxiliary space to store the frequencies of the elements. right?

[@Engineerhooon]

Thanks for pointing it out. You are correct.

[@aditigupta4795]

Thanks for the video but what is the intuition behind this solution? why do we move the specific pointers for particular conditions?

[@Engineerhooon]

If you are familiar with quick sort algorithm you can relate the idea of using a pivot element to group all elements smaller than the pivot element to the left of the pivot element and group all elements larger than the pivot element to the right side of pivot element to get a sorted list of element. Similarly, here we are moving pointers based on specified conditions to group 0s, 1s and 2s. I would recommend you to watch it again, the video will make more sense now.

[@ashutoshrai2717]

Sir please bring some more videos on algorithms

[@Engineerhooon]

Noted!