Search topics...
All Problems

Sum of Two Integers

Solution Approach
Was this helpful?
MediumbitsExpected: O(1) bounded by 32 iterations for 32-bit integers time, O(1) space
bit-manipulation

Problem

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

Constraints: -1000 <= a, b <= 1000

Example 1:

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

Example 2:

Input: a = 2, b = 3
Output: 5
Reference solution unlocks after your first submission
Loading...