Problem in Move all X at end problem

#1


I am getting segmentation fault.

#2

Implementation is not right, logic seems correct
do this

if(s[i]=='x')
	{
        int count =0; 
        int init = i;
		while(s[init]!=n)
		{
            if(s[init]=='x')count++;
			s[init]=s[init+1];
			init++;
		}
        s[n-1]='x'; 
		s[n]='\0';
        if(count==(n-i))return abc(s,n) 
		return abc(str,i);

	}
#3

Coding Blocks IDE
Made changes according o your code still getting segmentation fault

#4

Check now ->


Passing all test cases.

#5

Can you please expain why have you done return abc(s,n); whereas the function abc is void.

#6

this is done when we have placed all x at the end of the array, so i have sent n in place of i so that in base condition when i is equal to n, we return cause our work is done. Dry run it, you will understand the intuition . If find it difficult let me know will help accordingly.

#7

I am not asking that I am asking about using return abc(s,n); when the function abc is void, shouldn’t it be abc(s,n);

#8

You can do that also, it’s same.

#9

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.