Help me with approach?

#1

can you help me with the approach??

TA is not responding?
#2

Basically you have been given a string with same characters, so you have to first determine all possible permutations of a particular input string and along with that you have to also keep a record of those permutations and then you will check if they are redundant, then no need to include them in your final ans, else include those permutations in your final answer…

#3
#4

printing no output please help

#5

how to solve it without map

#6
#7

this is my code can you tell me how to take care of repititve string case

#8

Pls wait .I m checking with your code…

#9

You can maintain a temp string …store your result in tht…and simply check for the following :
int k=0;
print_permutations(input,0,k,temp);
string s[100000];
int r=0;
for(int i=0;i<k;i++)
{
int flag=0;
for(int j=i+1;j<k;j++)
{
if(temp[i]==temp[j])
{
flag=1;
}
}
if(flag==0)
{
s[r]=temp[i];
r++;
}
}
sort(s,s+r);
for(int i=0;i<r;i++)
{
cout<<s[i]<<endl;
}