Login

All Problems

Problem title

Difficulty

Avg time to solve

Exploring Restaurants

Moderate

35 mins

Square Root Of An Integer

Easy

20 mins

Pattern Matching

Moderate

15 mins

Minimum Swaps To Make Two Strings Equal

Hard

30 mins

Maximum Number

Easy

15 mins

Bridges In A Graph

Moderate

25 mins

Chocolate Fest

Moderate

25 mins

Can Place Books

Easy

15 mins

Water flow

Hard

10 mins

Friends Pairing Problem

Easy

10 mins

Problem

Submissions

4

Avg. time to solve

15 min

Success Rate

85%

Problem Statement

```
Input array [1,3,2,7] so basically this array represents the number 1327.
All the possible combinations are :
1. [3 1 2 7] get by swapping indices 1 and 2.
2. [2 3 1 7] get by swapping indices 1 and 3.
3. [7 3 2 1] get by swapping indices 1 and 4.
4. [1 2 3 7] get by swapping indices 2 and 3.
5. [1 7 2 3] get by swapping indices 2 and 4.
6. [1 3 7 2] get by swapping indices 3 and 4.
Out of all the possible combinations, 3 give the maximum number as 7321, so we will return [7 3 2 1].
```

```
The input may have 0 before the most significant digit. e.g. [0,3,5,7] is a valid input and this represents number 357.
```

```
The first line of input contains a single integer T, representing the number of test cases. Then the T test cases follow.
The first line of each test case contains a number N denoting the size of the array.
The second line contains N space-separated distinct integers a1, a2, ..., aN — the array elements.
```

```
For each test case, print the output array where elements are separated by space.
The output of every test case will be printed in a separate line.
```

```
You don’t have to print anything, it has already been taken care of. Just implement the given function.
```

```
1<= T <=100
2 <= N <= 10^4
0 <= A[i] <= 9
Where 'A[i]' denotes the 'ith' element of the array.
Time limit: 1 sec
```

```
4
4
3 2 1 4
3
0 9 7
7
3 2 1 1 2 3 9
5
9 8 1 8 7
```

```
4 2 1 3
9 0 7
9 2 1 1 2 3 3
9 8 8 1 7
```

```
(i) We can get the maximum number by swapping 1 and 4.
(ii) We can get the maximum number by swapping 1 and 2.
(iii) We can get the maximum number by swapping 1 and 7.
(iv) We can get the maximum number by swapping 3 and 4.
```

```
4
5
9 8 7 6 5
4
5 6 7 9
7
9 8 0 3 4 5 6
2
1 2
```

```
9 8 7 6 5
9 6 7 5
9 8 6 3 4 5 0
2 1
```

```
(i) We do not have a need to perform the operation as the number is already maximum.
(ii) We can get the maximum number by swapping 1 and 4.
(iii) We can get the maximum number by swapping 3 and 7.
(iv) We can get the maximum number by swapping 1 and 2.
```

Console

Sample Test Case

Custom Test Case

Download Test Cases

Test Case 1

Test Case 2

Test Case 3

Saving Code...

Full Screen Mode

Change Language

Change Theme

Solution submission not allowed

Save Code

Reset Code