# Mice And Cheese: Practice Notes

Mice And Cheese shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Mouse1 must eat exactly k types (score reward1) and mouse2 eats the rest (reward2). Give everything to mouse2 first, then reassign the k types with the largest (reward1[i]-reward2[i]) to mouse1.

## 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 log n).

## Common mistake

Giving mouse1 the k largest reward1 values without considering what mouse2 loses.

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