# Find The Student That Will Replace The Chalk: Practice Notes

Find The Student That Will Replace The Chalk shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Students 0..n-1 use chalk[i] in a cycle; return the first who cannot finish when k pieces remain. Reduce k modulo sum(chalk), then scan once.

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

## Common mistake

Simulating all k units without the modulo (k can be 1e18), or returning the student who uses the last piece rather than the one who runs out.

## 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 AI interview helper that uses your resume.