# Elias Fano Monotone Codes: Practice Notes

Elias Fano Monotone Codes shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Store the upper bits of a monotone sequence as a unary-coded bitvector of bucket occupancies and the lower bits packed densely, supporting select-based access.

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

About 2 + log(U/n) bits per entry for n increasing integers in 0, U), with O(1) access via select.

## Common mistake

Encoding the upper bits as raw integers instead of a unary occupancy bitvector, which loses the select-based indexing.

## 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 assistant for technical interviews
.