Top-to-Bottom Reachability and Minimum-Cost Paths in a Binary Grid

Grid Path Query Hard · Topics · Company Tags · Hints You are given an m x n binary grid grid. A 1 means the cell is open and can be entered, while a 0 means the cell is blocked. From an open cell, you may move only to an orthogonally adjacent open cell. A valid route starts at any open cell in row 0 and stops when it first reaches any open cell in row m - 1. A route is simple if no [row, column] coordinate appears more than once. Two routes are distinct when their coordinate…