Company: Microsoft intern
Difficulty: medium
Grid Path Optimization 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. Function Signature int solution(vector<int> &A, vector<int> &B); that, given two arrays of integers A and B, of length N, returns the maximum value on the optimal path. Constraints N is an integer within the range [1..100,000] each element of arrays A and B is an integer within the range [-1,000,000,000..1,000,000,000] Examples Example 1: A = [3, 4, 6] B = [6, 5, 4] Output: 5 The optimal path is 3 → 4. Maximum value encountered is 5. 3 4 6 6 5 4 Example 2: A = [1, 2, 1, 1, 1, 1] B = [1, 1, 1, 3, 1, 1] Output: 2 1 2 1 1 1 1 1 1 1 3 1 1 Example 3: A = [-5, -1, -3] B = [-5, -5, -2] Output: