New update is available. Click here to update.

Last Updated: 27 Mar, 2021

Difficulty: Easy

```
Let’s say we have ARR = { {5 4 5} , {1 2 6} , {7 4 6}} so the path with
maximum value will be 5 -> 4 -> 5 -> 6 -> 6 and we have to return
the minimum value in this path as the answer i.e 4.
```

```
The very first line of input contains an integer ‘T’ denoting the number of test cases.
The first line of every test case contains two integers ‘R’ and ‘C’ denoting the number of rows and columns respectively.
Then the remaining input is of R lines where each line contains C space-separated numbers denoting the elements of the RXC sized matrix ‘ARR’.
```

```
For each test case, return the minimum value in the maximum path.
Output for each test case is printed on a separate line.
```

```
You do not need to print anything, it has already been taken care of. Just return the minimum value in the maximum path.
```

```
1 <= T <= 10
1 <= R , C <= 100
0 <= ARR[i][j] <= 10^9
Time Limit: 1 sec
```

SIMILAR PROBLEMS

Min Heap Implementation

Posted: 22 Jun, 2022

Difficulty: Moderate

Ninja and the experiment

Posted: 5 Sep, 2022

Difficulty: Moderate

Find Median from Data Stream

Posted: 9 Sep, 2022

Difficulty: Moderate

Search In A Sorted 2D Matrix

Posted: 23 Nov, 2022

Difficulty: Moderate

Spiral Matrix

Posted: 24 Nov, 2022

Difficulty: Easy

Popular Interview Problems: