Given two strings S and A . Print "1" if both strings are anagrams otherwise print "0" .
Input: First line of input contains a single integer T which denotes the number of test cases. T test cases follows, first line of each test case contains a string S. Second and last line of each test case consists of string A.
Output: Corresponding to each test case, print the required output.
Constraints:
1<=T<=100
1<= length(S and A) <=1000
Example:
Input:
2
cdbkdub
dsbkcsdn
geeks
skgee
Output:
0
1
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.
| preparecodinginterview_dot_com | 190 |
| __murugan__ | 173 |
| manvimahajan20 | 140 |
| xiaoyan_yunche | 139 |
| ShameekAgarwal | 116 |
| preparecodinginterview_dot_com | 190 |
| __murugan__ | 173 |
| manvimahajan20 | 166 |
| SoumyaKaushik | 146 |
| arpit_anshuman | 140 |
| blackshadows | 5331 |
| Ibrahim Nash | 5219 |
| akhayrutdinov | 5111 |
| mb1973 | 4929 |
| Quandray | 4567 |