# Fair Distribution Of Cookies: Walkthrough
Fair Distribution Of Cookies shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Assign each bag to one of k children (backtrack, assign to the current minimum to prune) and minimize the maximum load.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(k^n) pruned.
## Common mistake
Giving bags out in order without reconsidering assignments, which can unbalance the last child.
## 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 real-time AI interview assistant for live interviews.