Daffodil International University
Problem Link
//Please follow from main function
#include<bits/stdc++.h>
using namespace std;
set<char>ch;
int main()
{
int len, tc;
cin>>tc;
while(tc--)
{
string s;
cin>>s;
len=s.size();
if(len==1)
{
cout<<"-1"<<endl;
continue;
}
int j=len-1;
for(int i=0; i<len; i++)
{
ch.insert(s[i]);
ch.insert(s[j]);
j--;
}
if(ch.size()==1)cout<<"-1"<<endl;
else
{
j=len-1;
int k=0;
for(int i=0; i<len; i++)
{
if(s[i]==s[j]){
k=1;
break;
}
else break;
j--;
}
if(k==1){
sort(s.begin(), s.end());
cout<<s<<endl;
}
else cout<<s<<endl;
}
ch.clear();
}
return 0;
}
0 Comments