Sort 0s, 1s and 2s | GeeksForGeeks | Problem of the Day

[@mathematics3398]

class Solution: def sort012(self,arr,n): start = 0 end = n - 1 index = 0 while index

[@mathematics3398]

Table of Contents 0:00 Problem Statement 0:44 Naive Solution 2:44 Optimal Solution 8:52 Code

[@Gamer2-ux2em]

Brother please suggest me intuitive and applied thorough resources to learn dsa based on your experience, no matter it's free or paid .🙏

[@mathematics3398]

My suggestion would be to first be thorough with Data Structure Concepts such as Linked List, Tree, Heap etc. And then develop a basic understanding of design and analysis of algorithms. Once you are thorough with this you can try solving problems online - GeeksForGeeks, Leetcode etc. A good place to start would be to read this book - Data Structures And Algorithms Made Easy (Paperback, Narasimha Karumanchi) It is a very comprehensive book and is highly recommended for beginners.

[@mathematics3398]

class Solution { public: void sort012(vector& arr) { int start = 0, index = 0, end = arr.size() - 1; while (index