# LLL Lattice Basis Reduce: Walkthrough

LLL Lattice Basis Reduce shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Swap adjacent basis vectors when they violate the Lovasz condition and size-reduce against previous vectors so the basis becomes short and nearly orthogonal.

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

Polynomial time (about O(n^5) bit operations in classical analyses) for a fixed approximation factor.

## Common mistake

Size-reducing only after a swap rather than before testing Lovasz, which can loop or accept a badly skewed basis.

## 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 the Linkjob AI app.