New update is available. Click here to update.

Posted: 15 Mar, 2021

Difficulty: Moderate

- If the length of the string is greater than 1:

- If the length of the string is 1 then stop.

```
If ‘S’= “great” and ‘W’= “tagre”, ‘S’ can be rearranged to form ‘W’.
‘S’ = “gre” + “at” (We choose to swap ‘X’ & ‘Y’)
‘S’ = “at” + “gre”
Now letting “gre” as it is and applying operation on “at”.
‘S’ = “a” + “t” + “gre”
Swapping “a” and “t”
‘S’ = “t” + “a” + “gre”
Therefore ‘S’ can be rearranged into ‘W’.
```

```
Both strings are of the same length and operations can only be applied to string ‘S’.
```

```
The first line contains a single integer ‘T’ representing the number of test cases.
The first line of each test case contains a single integer ‘N’ denoting the length of the string ‘S’ and ‘W'.
The next line of the test case contains two space-separated strings ‘S’ and ‘W’.
```

```
For each test case print ‘True’ if ‘S’ can be rearranged to form ‘W’ else print ‘False’.
```

```
You do not need to print anything; it has already been taken care of. Just implement the function.
```

```
1 <= T <= 50
1 <= N <= 20
Time Limit: 1sec
```

Categories:

Popular Courses: