# Count Collisions Of Monkeys On A Polygon: Practice Notes

Count Collisions Of Monkeys On A Polygon shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Each monkey walks left or right; the only non-colliding assignments are all-left and all-right, so the answer is 2^n - 2 mod 1e9+7.

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

## Common mistake

Returning 2^n or 2^n - 1 and missing both unanimous directions.

## 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 assistant for technical interviews.