# Shortest Path In A Grid With Obstacles Elimination (Practice 5238): Notes
Interviewers use this pattern to test whether you can state the invariant before coding. Here is a compact rehearsal note.
## Approach
BFS on (r, c, remaining-eliminations).
```python
# sketch the invariant first, then fill in the loops
def solve(data):
# implement shortest-path-in-a-grid-with-obstacles-elimination
return data
```
## Complexity
Linear in the dominant input size for the scan; heap/tree variants add a log factor.
## Interview pitfalls
State the invariant out loud, name the complexity, then code. Skipping the invariant is the usual fail mode.
## Practicing out loud
Narrate the approach, complexity and one edge case in under a minute. Disclosure: I work on Linkjob AI, a real-time interview assistant. If you want live practice help, see AI coding interview assistant.