Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2290. Minimum Obstacle Removal to Reach Corner
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.