# Burrows Wheeler Inverse Last: Explained

Burrows Wheeler Inverse Last shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

The last-to-first mapping reconstructs the original string from the BWT column by walking LF ranks, usually via a first-occurrence table and occurrence counts.

## 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) after O(n) count tables, or O(n log sigma) with wavelet-backed ranks.

## Common mistake

Building C[] from sorted first-column ranks off by one, which rotates the recovered string.

## 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 Linkjob.ai.