# Minimum Operations To Convert Number: Study Guide
Minimum Operations To Convert Number shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
From start, in one op you add or subtract or XOR a number from nums, staying in [0,1000]; reach goal. BFS on the 0..1000 states; each state tries 3*|nums| moves. Answer is the BFS distance, or -1.
## 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(1000 * |nums|).
## Common mistake
DFS without memo (loops) or allowing values outside 0..1000.
## 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 interview copilot.