Blind 75 / Bit Manipulation / Sum of Two Integers

Sum of Two Integers

MediumBit Manipulation
Asked byFacebook

Problem

Given two integers a and b, return their sum without using the + or - operators.

Examples

Example 1
Input:a = 1, b = 2
Output:3
Example 2
Input:a = 2, b = 3
Output:5

Constraints

  • -1000 <= a, b <= 1000

Solve it in the editor. Sign in free to run your Python or JavaScript against test cases, get a verdict, and track your attempts.

Solve on FeatCode →

How to approach it: the Bit Manipulation pattern

Work directly on a number's binary representation using bitwise operators — often turning an O(n) or O(log n) problem into a handful of O(1) operations.

Look for this pattern when

  • The problem talks about bits directly (count set bits, reverse bits, single number among duplicates).
  • You want a constant-time trick instead of a loop for a numeric problem.

Read the full Bit Manipulation guide →

Video walkthroughs

Original problem on LeetCode ↗

More Bit Manipulation problems

← Missing NumberSingle Number →