# Bulb Switcher II: Walkthrough
Bulb Switcher II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Four commuting involutive flips give at most 16 patterns, and n reduces to 6 because the 3k+1 pattern repeats. Enumerate reachable states after at most m presses.
## 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
Simulating presses as if order matters, or keeping n large without reducing the state.
## 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 learn more.