TRICKY PERMUTATIONS(hackers block)

#1

i am not able to pass every testcase. can you please check my code

#2

https://ide.codingblocks.com/s/104913 - this is the url of my code

#3

@Ayushi21
As you can see your outputs are not in sorted order. The problem expects answers to be sorted in lexographic order. So try sorting them.

Make a vector of strings in global scope
vector < string > v;

Instead of printing the ‘ans’ string in Line No. 8 , store this string in the vector using the push_back( ).
i.e. instead of the current Line No. 8 statement , write this
v.push_back(ans) ;

This will store all your output strings in the vector v and when your recursive calls are done , you will have a vector of strings in which your output strings are stored . Now the only thing we need to do is sort them.

So sort them using the sort( ) of < algorithm >

This is what your main( ) would look like :
int main( ) {
string input ;
cin >> input ;
printPermutationsNoDuplicates(input,"");

//after the recursive calls are done , your vector v declared in global is ready … just sort it .
sort( v.begin() , v.end() ) ;

//Print the contents of vector v using a loop

return 0;
}

#4

https://ide.codingblocks.com/s/105046 - is this what you are tryna say

#5

@Ayushi21
Modified code - https://ide.codingblocks.com/s/105078
You need not have removed the if condition in the recursive function.
Also you missed out on printing the final answer from the vector.