 3

# Split Concatenated String

Difficulty: MEDIUM
Avg. time to solve
25 min
Success Rate
75%

Problem Statement
Suggest Edit

#### String x = x1x2... x|x| is lexicographically larger than string y = y1y2... y|y|, if either |x| > |y| and x1 = y1, x2 = y2, ..., x|y| = y|y|, or exists such number r (r < |x|, r < |y|), that x1 = y1, x2 = y2, ..., xr = yr and xr + 1 > yr + 1.

##### Input Format :
``````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.
``````
##### Output Format :
``````For each test case print the lexicographically biggest string.
``````
##### Constraints :
``````1 <= T <= 50
1 <= N <= 100
1 <= length of string(si) <= 100  for all  1 <= i < = n

Time Limit: 1sec
``````
##### Sample Input 1 :
``````2
2
abc def
1
aab
``````
##### Sample Output 1 :
``````fedcba
baa
``````
##### Explanation For Sample Input 1 :
``````In the first case
The possible strings after looping:-
-abcdef-, -abcfed-, -cbadef-, -cbafed-, where - represents the loop.
From 4th string =cbafed
On cutting the string about f
fed+cba=fedcba
The lexicographically biggest possible string is fedcba.

In the second case
The possible strings are:-
aab baa
The lexicographically biggest possible string is baa.
``````

#### Sample Input 2 :

``````2
3
aaa ccc ddd
2
azy bom
``````

#### Sample Output 2 :

``````dddaaaccc
zamoby
``````   Console