Move Zeroes (LeetCode 283) | Full Solution explained with examples | Study Algorithms

[@HarshPatel-hu5sr]

I honestly love your way of teaching, you would make an AMAZING professor

[@nikoo28]

Wow, thank you!

[@reactninja6567]

Hands Down this is the best soln i have seen so far thanks! keep on going.

[@avengersshorts5949]

3:33 I Completed solving this problem in leetcode thank you ❤

[@saichaithrik7134]

Your way of teaching is one the best i have ever seen thank you sir

[@supershinobi7892]

you have made my coding journey very easy and understandable

[@ahmar8462]

On point and quick to grasp explanation. Keep posting

[@souravsarkarofficials]

Bhaiya apki samjhane ki tarika sach mei pura alag hei ...koi nhi rok sakta apko DSA mei 💪💪💪💪

[@abhinavd2]

one of the best teacher ever studied😍

[@kashikasinghal3250]

thank you for teaching the best and efficient approach. before watching this video i was struggling with the approach as mine took 336ms and the other videos were complex to understand, although it was only 5 min long but i couldn't get a loop;) nut this approach solved it in only 7ms...like this is crazy!

[@TejwantDataLab]

Thank you sir, really good explaination

[@mohanupreti4654]

Very fine explanation

[@UjjwalRaj-CSE-]

I am watching your video first time, you are great

[@TechnicalMasterAman]

under if condition, we can just do swap(nums[i],nums[insertPos])

[@deeptidip9864]

Such an easy explanation💫

[@ramielwan48]

Man I swear I asked chat gpt to explain it to me. I read the leetcode solution, and watched 2 other videos but none of them made sense to me. I wanted to understand how to approach it and not just copy and paste the solution. When you explained it, I was like damn that's easy 😅

[@nikoo28]

That is so nice of you. :)

[@vishwamitrasingh2667]

Great sir 🙏🙏🙏

[@ajayupadhyay4964]

you are a really great teacher !!

[@nikoo28]

Wow, thank you!

[@LuckyAndDad]

Thank you brother

[@viveknamdev2605]

Nice Explanation by you

[@jagratsahoo6885]

Thanks Nikhil

[@khaleabhishek5023]

amazing keep going

[@sammedpatil3907]

Very Nice Explanation

[@nikoo28]

Thanks and welcome

[@dewanshanand1395]

Amazing !!

[@pulastyadas3351]

You are really awesome❤

[@shubhamkumar-um2xi]

Great brother

[@Sakeer89]

Very easy solution

[@shubhamkumar-um2xi]

Very nice

[@vis2043]

Two pointer approach is also better one

[@alexivuckovich8005]

Loving all the videos so far, but with this one it seems incorrect to say it's O(n) becuase the array is iterated over only once. I think it's actually of O(n) because it's simplified from O(2n) in the worst case that the array is all zeros. What about adding a line a code before inserttPosition is incremented that checks if i > insertPosition and just set the i-th element to zero then?

[@nikoo28]

O(2n) simplifies to O(n)

[@karthik-varma-1579]

nikhil awaiting for the sheet that you said will release!!!

[@nikoo28]

Will release it soon

[@tufanpondu9511]

Sir you make me bound to subscribe to your channel and give like.😍😍😍😍

[@nikoo28]

glad to have you as my audience :)

[@Vasoya_Jaydeep]

This will take O(n + number of zeros) Time Here is one more solution with O(n) Time void moveZeroes(vector& nums) { int Pi =0 , Zi = 0; while(Pi < nums.size()) { if (nums[Zi] == 0) { while((Pi < nums.size()) && !nums[Pi]) { Pi++; } if (Pi >= nums.size()) break; int tmp = nums[Zi]; nums[Zi] = nums[Pi]; nums[Pi] = tmp; } Zi++; Pi++; } } /*End*/

[@rajdeepdas8393]

Just what the fuck happened......