Leetcode 283. Move Zeroes

[@8885664452]

Great explanation 👌

[@neelasatyasai6852]

i enjoing this series

[@ratnasanjay]

Thankyou bhaiya for this session

[@coding4u585]

Thank you sir.

[@vansh9857]

What if the elements were not sorted like 1 3 12 what if they were 0,3,1,0,12 how do we sort them after

[@pulkitchhajed3481]

by selection sort

[@mohdsaadalikhan7209]

how could we solve the follow-up part of this ques?

[@jsuryakt]

You can remove the while loop and make the nums[i] = 0 after nums[j++] = nums[i] and only when i !=j So it'lll be like if nums[i] != 0: nums[j] = nums[i] if i != j: nums[i] = 0 j += 1

[@IitTechnologyOfficial]

Please provide a video in Hindi

[@vaishnavirathore5579]

class Solution { public void moveZeroes(int[] nums) { int a[]=new int [nums.length]; int k=0,count=0; for(int i=0;i

[@ankitkumarghosh462]

else { nums[j]=0; j++; } why this gives wrong answer

[@mohammadfraz]

Can you send full code ?

[@ankitkumarghosh462]

@@mohammadfraz yes class Solution { public: void moveZeroes(vector& nums) { int n = nums.size(); int j=0; for(int i =0;i

[@mohammadfraz]

@@ankitkumarghosh462 Okay , take an example and try to dry run it in your code you will find the problem

[@ankitkumarghosh462]

@@mohammadfraz okkkkk

[@satyamsingh3]

@@ankitkumarghosh462 did you get it?