# Burrows Wheeler Transform Construction: Walkthrough

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

## Key idea

Sort the rotations of S$ and take the last column; the LF mapping plus the first column reconstructs the original string.

## 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) with a linear suffix array, O(n log n) naively.

## Common mistake

Forgetting the unique terminator, which makes rotations not uniquely sortable.

## 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 try it free.