| 6 | #define mod 1000000007 |
| 7 | #define endl '\n' |
| 8 | bool arePermutation(string a,string b){ |
| 9 | |
| 10 | int n=a.length(); |
| 11 | int m=a.length(); |
| 12 | if(n!=m) |
| 13 | return false; |
| 14 | sort(a.begin(),a.end()); |
| 15 | sort(b.begin(),b.end()); |
| 16 | for (int i = 0; i < n; i++) { |
| 17 | if(a[i]!=b[i]) |
| 18 | return false; |
| 19 | } |
| 20 | return true; |
| 21 | } |
| 22 | |
| 23 | int main(){ |
| 24 | cin.tie(0)->sync_with_stdio(0); |