How should I practice Optimal Path in a Grid?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Microsoft online assessment problems in FastPrep.

Is Optimal Path in a Grid associated with Microsoft?

FastPrep tags this as a Microsoft coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · Dynamic Programming

Optimal Path in a Grid

Learn this problem

● MediumMicrosoftINTERNOA

See Microsoft hiring insights

Problem statement

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.

Function

solution(A: int[], B: int[]) → int

Examples

Example 1

A = [3, 4, 6]B = [6, 5, 4]return = 5

The optimal path is 3 → 4 → 5 → 4.

Example 2

A = [1, 2, 1, 1, 1, 4]B = [1, 1, 1, 3, 1, 1]return = 2

Constraints

...