# Last Visited Integers: Study Guide

Last Visited Integers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

You walk a stream of words that are either positive integers or 'prev'. Keep a rolling list of the last seen numbers (a deque of the recent integers). On 'prev', look back k steps in that list (or record -1 if fewer than k numbers exist) and emit those answers.

## 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

O(n).

## Common mistake

Mutating the stream in place so a later 'prev' re-reads earlier 'prev' answers, or using a stack that pops numbers away instead of only looking back.

## 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 interview copilot app.