# FKS Perfect Hashing Two Level: Study Guide

FKS Perfect Hashing Two Level shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Hash into first-level buckets of size b_i and give each bucket a collision-free second-level table of size about b_i^2, so lookup is worst-case constant.

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

Expected O(n) space because the sum of squares of bucket sizes is linear when the first-level hash is well chosen.

## Common mistake

Allocating second-level tables of size b_i rather than Theta(b_i^2), which cannot guarantee no collisions.

## 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 interview copilot app.