Available question text
Find the minimum number of obstacles (cells with value 1) you must remove to get from the top-left to the bottom-right of an m×n grid moving 4-directionally; equivalently, compute the shortest path where entering a cell costs 0 for empty and 1 for an obstacle (a 0–1 weighted shortest-path problem suitable for 0-1 BFS/Dijkstra).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Salesforce
Leetcode 2290. Minimum Obstacle Removal to Reach Corner
Reported May 22, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source