CodeOath
← All problems

Sum of Two Integers

Medium
bit-manipulation

Given two 32-bit signed integers a and b, return their sum without using the + or - operators — use bitwise operators instead.

Example:

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

Constraints:

  • -1000 <= a, b <= 1000