# Find The Child Who Has The Ball After K Seconds: Practice Notes

Find The Child Who Has The Ball After K Seconds shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

The ball bounces between 0 and n-1; compute the position after k steps on that path.

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

## Common mistake

Using modulo n without reflecting at the ends.

## 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 multilingual AI interview assistant.