Problem Brief
Optimal Path in a Grid
INTERNOA
See Microsoft online assessment and hiring insights
You are given two arrays, A and B, each made of N integers. They represent a grid with N columns and 2 rows, where A is the upper row and B is the lower row.
Your task is to go from the upper-left cell (represented by A[0]) to the bottom-right cell (represented by B[N-1]) moving only right and down, so that the maximum value over which you pass is as small as possible.
Given two arrays of integers, A and B, of length N, returns the maximum value on the optimal path.
1Example 1
Input
A = [3, 4, 6], B = [6, 5, 4]
Output
5
Explanation
The optimal path is 3 → 4 → 5 → 4.
2Example 2
Input
A = [1, 2, 1, 1, 1, 4], B = [1, 1, 1, 3, 1, 1]
Output
2
Explanation
Constraints
Limits and guarantees your solution can rely on.
...