# Sum Of Two Integers: Study Guide
Sum Of Two Integers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Add without + by iterating XOR for the sum bits and (AND)<<1 for the carry until the carry vanishes. Mask to 32 bits in languages with unlimited ints.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(1) for fixed width.
## Common mistake
Forgetting the carry shift, so overlapping 1-bits are dropped.
## 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 coding interview assistant.