GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers
Problem :- Anagram
Submit Your Solution :- Click Here
Solution :-
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
while(t--){
string x,y;
cin>>x>>y;
auto key=false;
if(x.length()<y.length()||y.length()<x.length())
{
key=true;
}
else{
sort(x.begin(),x.end());
sort(y.begin(),y.end());
for(auto i=0;i<x.length();i++)
if(x[i]!=y[i]){
key=true;
break;
}
}
if(key)
cout<<"NO"<<endl;
else
cout<<"YES"<<endl;
}
}
Output:-
0 Comments: