beingsde
Sign In
Back to all DSA patterns
Bit Manipulation•Pattern: Bit Manipulation•Medium

Sum of two integers without + or - operators

Problem Intuition & Objective

Add two integers using only bit operations.

Time ComplexityO(1) — 32 bits max
Optimal
Space ComplexityO(1)
Memory Bounds
Optimal Algorithmic Approach

Iterative bit manipulation: sum = a XOR b, carry = (a AND b) << 1.

Core Invariants & Edge Cases

  • XOR gives the sum without carry
  • AND << 1 gives the carry
  • Repeat until carry is 0
Previous ProblemFind all anagrams of P in SNext Problem Number of 1 bits (Hamming weight)

System Design & Architecture Roadmap

Coding interviews are only 50% of the bar. Master High-Level Design, distributed systems, and Object-Oriented LLD.

60+ HLD QuestionsSharding, caching, and real-time distributed systems.27 LLD BlueprintsObject-oriented design patterns with class diagrams.SDE Quick ReferenceLatency numbers and database selection matrix.