# RLE Iterator: Practice Notes
RLE Iterator shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
An encoded array [freq, val, freq, val, ...] is consumed by next(n): skip forward n items and return the last value (or -1). Keep an index into the pairs and subtract from the current remaining freq.
## 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(1) amortized over the whole stream.
## Common mistake
Materializing the decoded sequence, which can be huge.
## 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 AI help for online coding assessments.