# Mirror Reflection: Explained

Mirror Reflection shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Reduce p and q by dividing out factors of 2. If p is odd and q odd, hit receptor 1; p odd q even hits 0; p even q odd hits 2.

## 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 (p+q)).

## Common mistake

Simulating the ray bounce by bounce, which needs careful floating point.

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