# Integer Replacement Bitwise: Study Guide

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

## Key idea

While n > 1, if n is even shift; if n is odd, pick n+1 or n-1 based on which is more 2-divisible (except n==3). Count the steps.

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

## Common mistake

Always subtracting 1 from odds, which is worse for numbers like 3 mod 4 in some cases — handle n=3 separately.

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