# Bulb Switcher IV: Explained

Bulb Switcher IV shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Start from all zeros and a flip at i flips every bulb from i to the end. The minimum flips equal the number of times the target string changes value (plus one if it starts with 1), because each change needs a new flip starting there.

## 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 each flip across the suffix (O(n^2)) or flipping single bulbs independently.

## 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 job search and interview copilot.