Snapchat SDE Interview Question 2021 August | Advanced BFS State Management | Off-campus

Question 1: Shortest Path in a Grid with Obstacles Elimination Problem Statement You are given an m x n integer matrix grid where each cell is either 0 (empty) or 1 (obstacle). You can move up, down, left, or right from and to an empty cell in one step. Return the minimum number of steps to walk from the upper left corner (0, 0) to the lower right corner (m - 1, n - 1) given that you can strictly ...