All Problems

Problem title

Difficulty

Avg time to solve

Flip Bits

Easy

15 mins

Sum Of Max And Min

Easy

10 mins

Duplicate In Array

Easy

15 mins

K Largest Element

Moderate

10 mins

Add Two Numbers As Linked Lists ll

Moderate

10 mins

N-th Fibonacci Number

Moderate

40 mins

Alien dictionary

Hard

46 mins

Order of People Heights

Ninja

45 mins

Search In Rotated Sorted Array

Moderate

30 mins

Allocate Books

Moderate

10 mins

Problem

Submissions

141

Avg. time to solve

10 min

Success Rate

90%

Problem Statement

```
Can you do the above task in a minimum number of comparisons?
```

```
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 single integer N representing the size of the array 'ARR'.
The second line of each test case contains N space separated integers representing the elements of the array “arr”.
```

```
For each test case, print the sum of the maximum and minimum element of the array 'ARR'.
```

```
You do not need to print anything. It has already been taken care of. Just implement the given function.
```

```
1 <= T <= 10
1 <= N <= 10^5
-10^9 <= ARR[i] <= 10^9
Time limit: 1 second
```

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

```
7
5
```

```
For the first test case, the maximum element in the array is 6 and the minimum element in the array is 1.
For the second test case, the maximum element in the array is 9 and the minimum element in the array is -4.
```

```
2
5
3 3 3 3 3
1
-1
```

```
6
-2
```

Java (SE 1.8)

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 Theme

Solution submission not allowed

Save Code

Reset Code