# Maximum Candies You Can Get From Boxes: Practice Notes

Maximum Candies You Can Get From Boxes shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Boxes may be open or locked, and each can hold candies, keys, and more boxes. You start with some boxes (given initial). This is a BFS/queue over boxes you currently possess: if a box is open (or you already have its key) you may open it, take candies, gain its keys, and receive the nested boxes. Keep a set of keys and a set of possessed-but-still-locked boxes so a newly found key can unlock a waiting box.

## 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 + total contents).

## Common mistake

Opening a locked box without a key, or discarding a locked box you already hold so a later key cannot open it.

## 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 https://www.linkjob.ai/.