Best solution I've seen for this problem. This channel is so underrated.
@jameswalt2199Ай бұрын
YOU MADE IT THE SIMPLEST TO UNDERSTAND WITHOUT COMPLICATING THINGS!!!!! HAT'S OFF TO YOU!
@unanimous85102 ай бұрын
Man that’s the best explanation. I saw the coded solution for this problem which is same as yours but couldn’t wrap my head around it. Now I got it! Thank you!
@moezzzz93417 ай бұрын
Your the best bro. The problem seems so easy with the way you explain it. Thanks again. Also this is my solution in python based on your approach class Solution: def sortColors(self, nums: List[int]) -> None: """ Do not return anything, modify nums in-place instead. """ start = 0 middle = 0 end = len(nums ) - 1 while middle
@azharsofi2854 Жыл бұрын
your teaching is next level
@omdongare20057 ай бұрын
Your the best bro. The problem seems so easy with the way you explain it. Thanks again. Also this is my solution in python based on your approac
@shwetayadav42447 ай бұрын
your explanations are really amazing. In fact, best so far :) Please make more videos :)
@sarthakgadge52232 ай бұрын
Thanks man this helped me a lot, loved your energy throughout the problem.
@shabanlukyamuzi401211 ай бұрын
Best explanation on KZfaq for the problem
@sithutun6883 ай бұрын
best explanation Sir! I didn't watch the coding part before solving the problem. So I implemented it using if-else statements.After solving, I watched the last part. I found out you wrote it using switch cases. Understanding both versions make me confident in coding
@Aspiringactor026 күн бұрын
This is better than strivers i watched him then i watched you had a strongn feeling this would be good🎉
@anayatk.0078 ай бұрын
Thank you for providing such fantastic content
@BroskiXP3 ай бұрын
Great explanation, good work
@mayankbadika31017 ай бұрын
very good explanation! keep up the good work
@user-yh2vm8ge2u4 ай бұрын
VERY NICE EXPLANATION WITH CLARITY . THANKS BHAIYA .
@neeeelll_ Жыл бұрын
Beautifully explained. could u please come up with topic based important questions
@vinoths7140 Жыл бұрын
Great Explanation, Thank You.
@dylanjara201 Жыл бұрын
Perfect explained. Ty sir!!
@omsudhamsh.h3 ай бұрын
Picture perfect mate! Thanks.
@apex095 Жыл бұрын
elegant solution. could you please add more questions on variety of topics like Stacks and Queues etc on your website ?
@user-wj4eg4rx4j10 ай бұрын
Underrated!
@LokeshSharma-hm5jz11 ай бұрын
i dont know why i developed a fear for this problem. You made it very easy. Thanks.
@nikoo2810 ай бұрын
I was once in the same boat as you my friend. :)
@user-fq1nn1vc2pАй бұрын
@@nikoo28 🙏🙏
@arnavkukreti200911 ай бұрын
you explain in a very good manner thank you
@nikoo2811 ай бұрын
So nice of you
@sumitraj93126 ай бұрын
Thank you, ploblem solved. love you 😁
@technicalguy.6 ай бұрын
Thank you soo much ❤❤
@sarthakgupta096 Жыл бұрын
Thankyou sir your way of teaching is amazing
@nikoo2811 ай бұрын
It's my pleasure
@subee1287 ай бұрын
Thank you
@iceyyeah6 ай бұрын
Thanks
@jerronjones47011 ай бұрын
Yay, someone I can understand
@pranavshekhar20485 ай бұрын
Great explaination! But I noticed one thing, in the first example, first swap is wrong as middle was at 0, so swap between start and middle should take place and start and middle should move and not between middle and end i.e 0 and 2 what you did because middle was not at 2.
@everyontech2716 Жыл бұрын
great explanation
@Harrish30 Жыл бұрын
Perfect!! Thanks
@officialdreamplayz5 ай бұрын
i used selection sort
@user-un9ri4vt7l4 ай бұрын
sir, I actually used in-built sort function, in leetcode ie. sort(nums.begin(),nums.end()), and it said said, u beat 100% users with c++. Can we do this or not???
@nikoo284 ай бұрын
You can, but your interviewer and ask you to solve it without sorting.
@KarthikC-ju4fx2 ай бұрын
❤
@CPS_XI5 ай бұрын
💯❤
@iiju8212 Жыл бұрын
Bhai kaafi mast samjhaya.
@user-ik1qr9ez2b6 ай бұрын
why we are not incrementing mid when it is arr[mid] is 2?
@nikoo286 ай бұрын
we swap it out, and put the 2 at the end. so we don't increment it. we need to see what came after the swap.
@bhargavinaik81452 ай бұрын
@@nikoo28 I solved it on leetcode, i knew it would fail for some testcases and it did, I kept trying to understand what was the pattern of those test cases, your answer made understand that exact point. Thanks :)
@m-bk4um10 ай бұрын
good
@shenth274 ай бұрын
why don't we just loop through the entire array and count the 0's and 1's in seperate variables, then loop the array again and replace number of 0, 1, 2 in that order.
@DohaZilaoui-zq1gx4 ай бұрын
Its just of solution of 10000000000solutions that u should keep it in your mind
@nikoo284 ай бұрын
There are multiple ways to approach the problem. You want to do in the fastest way possible. It cannot get faster than a single scan
@unemployedcse35143 ай бұрын
but interviewer won't be impressed by this approach 😂😂
@SubhajitDas-mt7sn2 ай бұрын
c++ class Solution { public: void sortColors(vector& nums) { int start = 0; int middle = 0; int end = nums.size() - 1; while (middle
@ankitraj41792 ай бұрын
Java Solution (Beats 100 %) class Solution { public void sortColors(int[] nums) { int n = nums.length ; int[] arr = new int[3] ; int element = 0 ; for(int i = 0 ; i < n ; i++){ element = nums[i] ; arr[element]++ ; } int count = 0 ; int k = 0 ; for(int i = 0 ; i 0){ nums[k] = i ; k++ ; count-- ; } } } }
@chessps Жыл бұрын
more easier!!! class Solution { public static void sortColors(int[] nums) { int zero = 0; int one = 0; int two = 0; for (int i: nums) { if(i==0){ zero++; } else if (i==1) { one++; }else { two++; } } for (int i = 0; i < nums.length ; i++) { if(zero!=0){ zero--; nums[i]= 0; } else if (one!=0) { one--; nums[i]= 1; }else if(two!=0) { two--; nums[i]= 2; } } } }
@kidoo156711 ай бұрын
But complexity?
@hwval-zw4hy7 ай бұрын
Why not just count zeroes and ones and refill the array in place? 😂
@nikoo287 ай бұрын
You will need to iterate over the array twice. First to count all the different 0 and 1s. Next iteration will be to actually fill all the elements. In the approach I discuss, we just do a single scan of the array.
@hwval-zw4hy7 ай бұрын
@@nikoo28 I like your solution. One pass is good. Though counting involves same big O complexity and simpler approach. I also think your solution fits better definition of in-place. E.g. if these were objects, not integers to sort: mine solution wouldn't be acceptable.
@nenuanenenuane6645 Жыл бұрын
// Java code to sort an array of integers // with the help of single loop import java.util.*; class Geeks_For_Geeks { // Function for Sorting the array // using a single loop public static int[] sortArrays(int[] arr) { // Finding the length of array 'arr' int length = arr.length; // Sorting using a single loop for (int j = 0; j < length - 1; j++) { // Checking the condition for two // simultaneous elements of the array if (arr[j] > arr[j + 1]) { // Swapping the elements. int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; // updating the value of j = -1 // so after getting updated for j++ // in the loop it becomes 0 and // the loop begins from the start. j = -1; } } } Bro can we use this as well plz let me know
@xyzsince9 күн бұрын
Too difficult to understand what he says because of his accent.