Very very nice explanation. I saw many videos but not clear. Your explanation was just crisp and neat👌. Can you pls solve all the grind 75 list questions.
Hey Alisha, are you still pursuing data structures and algorithms, If yes can we do pair problem solving. Please let me know your point of view on the below :- Cause most probably it's better to get pair problem solver instead of solo problem solver.rd Also I found your problem solving techniques and your thought process over problems is good, So, I thought if you can share some experience. Please let me know if you have any queries. Thanks and Regards, Raj
because it takes O(2N), while this approach, also known as Dutch National Flag Algorithm, takes only O(N) time, although both are considered, although its not much of a difference, O(N) is still faster than O(2N).
Very very nice explanation. I saw many videos but not clear. Your explanation was just crisp and neat👌. Can you pls solve all the grind 75 list questions.
Simply count the frequencies in one iteration and then refill array using these frequencies in another iteration?
good explanation. thank you very much
The explanation was amazing..keep doing 👍
Explanation is superb but kindly use the mic in future for better voice quality
The explanation was quite clear....thank you :)
wow.... great explanation
wow awesome
Funfact is that if you just write sort(a,a+n), it will work although it is using nlogn but all test cases will be passed
Likha toh hai O(n) hona chahiye time complexity. O(nlogn) ka achaar dalega kya?
Ma'am. 29 line where you write else if(a[mid==2]) // else if(a[mid]==2) which is right answer?
Great explanation💓....
Thank you so much. Helped out a lot.
thank you mam
Nice session Alisha.
Hey Alisha, are you still pursuing data structures and algorithms, If yes can we do pair problem solving.
Please let me know your point of view on the below :-
Cause most probably it's better to get pair problem solver instead of solo problem solver.rd
Also I found your problem solving techniques and your thought process over problems is good,
So, I thought if you can share some experience.
Please let me know if you have any queries.
Thanks and Regards,
Raj
@@rajdutta5149 lol
Thank you!!!
Why sort(a,a+n) doesn't work
Thanks Bro
Why don't just count the number of 0, 1, 2s, an then override the values of the array?
because it takes O(2N), while this approach, also known as Dutch National Flag Algorithm, takes only O(N) time, although both are considered, although its not much of a difference, O(N) is still faster than O(2N).
Im getting time limit exceeded
improve voice quality