New update is available. Click here to update.

Last Updated: 7 Mar, 2021

Moderate

```
The first line of input contains an integer βTβ denoting the number of test cases.
The next β2Tβ lines represent the βTβ test cases.
The first line of each test case contains one integers βNβ denoting the number of strings.
The second line contains N space-separated strings.
```

```
For each test case print the lexicographically biggest string.
```

```
1 <= T <= 50
1 <= N <= 100
1 <= length of string(si) <= 100 for all 1 <= i < = n
Time Limit: 1sec
```

Approaches

The key idea is to first check for all strings that if str[i]<reverse(str[i]) then replace str[i] by reverse(str[i]).After this split the concatenated string about all the character of the string.

**Algorithm** :

- First check for all strings that if str[i] <reverse(str[i]) then replace str[i] by reverse(str[i]).
- After iterating through all strings and for all strings iterate through its characters.
- For the jth character of string spit about this point.After splitting the given string will be temp=((j to len -1) characters of ith string) +( i+1 to n strings)+(0 to i-1 strings).
- If the temp is greater than ans then ans=temp
- In the end, return the ans string