New update is available. Click here to update.

Posted: 7 Mar, 2021

Difficulty: 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
```

SIMILAR PROBLEMS

Divisible Substrings

Posted: 29 Jul, 2022

Difficulty: Easy

Ninja and Numbers

Posted: 30 Jul, 2022

Difficulty: Moderate

Longest Palindromic Substring

Posted: 4 Sep, 2022

Difficulty: Moderate

Cakes

Posted: 23 Sep, 2022

Difficulty: Easy

1-3 Palindrome

Posted: 4 Oct, 2022

Difficulty: Easy

Categories:

Popular Courses: