# Filling Bookcase Shelves: Interview Notes

Filling Bookcase Shelves shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

dp[i] is the min height for the first i books. For each i, extend the last shelf backwards while the width fits and track its max height.

## 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^2).

## Common mistake

Greedily packing each shelf as full as possible.

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