BLACK FRIDAY: Up to 35% off Premium

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Low Level Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 1293. Shortest Path in a Grid with Obstacles Elimination

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.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late April, 2025

Oracle

Staff

Late March, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1293. Shortest Path in a Grid with Obstacles Elimination

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact