# Integer Replacement: Study Guide

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

## Key idea

From n you may go to n+1 or n-1 if n is odd, or n/2 if even; minimize operations to reach 1. Recurse/BFS with memo; when n is odd, pick n-1 except when n=3 or n%4==3 (then n+1 produces more twos).

## 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) with the bit rule.

## Common mistake

Always subtracting 1 on odds (which is slower for numbers like 3k+3) or overflowing n+1 when n is INT_MAX.

## 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 official website.