Sum of Two Integers

Compute the sum of two integers without using the + or - operators. Leverage bitwise XOR for sum and AND with shift for carry, repeating until no carry remains. This technique simulates full-adder logic in software.

Examples
Input: [1,2]
Output: 3
Hints
Related Problems

Sum of Two Integers

Compute the sum of two integers without using the `+` or `-` operators. Leverage bitwise XOR for sum and AND with shift for carry, repeating until no carry remains. This technique simulates full-adder logic in software.