# Design Browser History: Practice Notes

Design Browser History shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Two stacks (back and forward) or a doubly linked list of URLs plus a current pointer. Visit clears the forward history; back(steps) and forward(steps) move the pointer and return the current URL.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (linked-list rewiring, two pointers, or a monotonic stack) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(steps) per move.

## Common mistake

Keeping a full array and forgetting to truncate the forward side on a new visit.

## 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 multilingual AI interview assistant.