 0

# Similar Strings

Difficulty: NINJA Contributed By
Omkar Deshmukh
Avg. time to solve
70 min
Success Rate
30%

Problem Statement

#### Your task is to return the maximum and minimum difference of the three strings for all the possible rotations of string a.

##### For Example:
``````If the value of 'N' is 2, 'A' is "ab" , 'B' is "aa" and 'C' is "bb".
Then the answer for this input is
min = 2
max = 2

Because current difference is 1 + 1 = 2
After one rotation difference will be 1 + 1 = 2
Hence, the minimum and the maximum answer is 2.
``````
##### Input Format:
``````The first line contains a single integer 'T' denoting the number of test cases to be run. Then the test cases follow.

First line: Single integer 'N' (the length of the three strings)

Following three lines: Strings 'A, 'B', and 'C', respectively.
``````
##### Output Format:
``````For each test case, Print two space-separated integers denoting the maximum and minimum difference of the three strings for all possible rotations of string a.

Output for each test case will be printed in a separate line.
``````
##### Note
``````You are not required to print anything; it has already been taken care of. Just implement the function.
``````
##### Constraints:
``````1 <= T <= 50
1 <= N <= 10^4

Time Limit: 1 sec.
``````
##### Sample Input 1:
``````2
3
abc
aaa
bba
2
ab
bb
ab
``````
##### Sample Output 1:
``````6 4
3 1
``````
##### Explanation For Sample Input 1:
``````For the first test case, there will be 3 possible rotations for the
string 'A'. in the first rotation, it will make the difference of 6 in
the second rotation, the difference will be 4 and in the third
rotation, the difference will be 6.

Hence max answer is 6, and the min is 4 here.

Similarly, in the second test case, the max answer will be 3 and
the min will be 1.
``````
##### Sample Input 2:
``````2
2
ab
bb
ac
2
ab
bb
ac
``````
##### Sample Output 2:
``````4 2
3 3
``````   Console