Shortest Path in a Grid with Obstacles Elimination: coding question

Available question text

Find the minimum number of steps from the top-left to bottom-right in a 4-directional binary grid if you may remove up to k obstacles; treat each position together with remaining eliminations as the state and perform a shortest-path search (BFS) over that expanded state space, returning the step count or -1 if unreachable.

Continue with questions that share topics or the same question type.

Find the Safest Path in a Grid
Coding · Array · Binary Search · Breadth-First Search
Shortest Path in Binary Matrix
Coding · Array · Breadth-First Search · Matrix
Maximum Number of Points From Grid Queries
Coding · Array · Breadth-First Search · Heap (Priority Queue)
Shortest Distance from All Buildings
Coding · Array · Breadth-First Search · Matrix

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 4 records

Amazon
Leetcode 1293. Shortest Path in a Grid with Obstacles Elimination
Reported Jul 26, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
Databricks
Leetcode 1293. Shortest Path in a Grid with Obstacles Elimination
Reported Nov 20, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source
Meta
Leetcode 1293. Shortest Path in a Grid with Obstacles Elimination
Reported Jul 26, 2026 · 4 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source
Oracle
Leetcode 1293. Shortest Path in a Grid with Obstacles Elimination
Reported Apr 24, 2025 · 1 source report
STAFF

Available question text

Shortest Path in a Grid with Obstacles Elimination

Available question text

Related questions

Shortest Path in a Grid with Obstacles Elimination

Available question text

Related questions