Best solution I've seen for this problem. This channel is so underrated.

YOU MADE IT THE SIMPLEST TO UNDERSTAND WITHOUT COMPLICATING THINGS!!!!! HAT'S OFF TO YOU!

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!

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

your teaching is next level

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

your explanations are really amazing. In fact, best so far :) Please make more videos :)

Thanks man this helped me a lot, loved your energy throughout the problem.

Best explanation on KZfaq for the problem

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

This is better than strivers i watched him then i watched you had a strongn feeling this would be good🎉

Thank you for providing such fantastic content

Great explanation, good work

very good explanation! keep up the good work

VERY NICE EXPLANATION WITH CLARITY . THANKS BHAIYA .

Beautifully explained. could u please come up with topic based important questions

Great Explanation, Thank You.

Perfect explained. Ty sir!!

Picture perfect mate! Thanks.

elegant solution. could you please add more questions on variety of topics like Stacks and Queues etc on your website ?

Underrated!

i dont know why i developed a fear for this problem. You made it very easy. Thanks.

you explain in a very good manner thank you

Thank you, ploblem solved. love you 😁

Thank you soo much ❤❤

Thankyou sir your way of teaching is amazing

Thank you

Thanks

Yay, someone I can understand

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.

great explanation

Perfect!! Thanks

i used selection sort

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???

❤

💯❤

Bhai kaafi mast samjhaya.

why we are not incrementing mid when it is arr[mid] is 2?

good

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.

c++ class Solution { public: void sortColors(vector& nums) { int start = 0; int middle = 0; int end = nums.size() - 1; while (middle

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-- ; } } } }

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; } } } }

Why not just count zeroes and ones and refill the array in place? 😂

// 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

Too difficult to understand what he says because of his accent.