# Broken Calculator Greedy: Interview Notes

Broken Calculator Greedy shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Work backward from target to start: if target is even, divide by 2; if odd, add 1 (which is the inverse of subtract 1). Stop at start and add the remaining decrement.

## 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 target).

## Common mistake

BFS forward from start, which is much wider.

## 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 AI copilot.