# A-Star Search With An Admissible Heuristic: Interview Notes

A-Star Search With An Admissible Heuristic shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Order the heap by g + h where h never overestimates, such as Manhattan distance on a grid.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

Depends on heuristic; worst case like Dijkstra.

## Common mistake

Using an overestimating heuristic and losing optimality.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at undetectable AI interview copilot.