One task case is not passing

#1

https://ide.codingblocks.com/s/232113 Please check the code

#2

@kt62495
optimise ur code using set

set store;
void permute(string str,int i)
{
if(i==strlen(s))
{
store.insert(s);
return ;
}
for(int j=i;j<strlen(s);j++)
{
swap(str[i],str[j]);
permute(str,i+1);
swap(str[i],str[j]);
}
return;
}