15% off all plans & roadmaps Use code
See plans
Preparing this workspace.
LeetCode 2290 · Solution & editorial
You are given a 0-indexed 2D integer array grid of size m x n. Each cell has one of two values:
Minimum Obstacle Removal to Reach Corner is a Graph Traversal Patterns (DFS & BFS) problem, in the Shortest Path (Dijkstra's Algorithm) subpattern. The pattern covers DFS/BFS traversal, topological sort, shortest paths, Union-Find, and MST
Master Dijkstra's algorithm for finding shortest paths in weighted graphs with non-negative edges.
The reference solution runs in O(m * n) time and O(m * n) space.
The full editorial is part of Pro
It explains the core insight, the complexity analysis and the common mistakes, with a worked solution.
Minimum Obstacle Removal to Reach Corner is a Graph Traversal Patterns (DFS & BFS) problem, in the Shortest Path (Dijkstra's Algorithm) subpattern. Once the approach above makes sense, write it yourself and then work through the neighbouring problems that reuse it.