BackeasyBit Manipulation

Single Number bitwise Solution

Problem Statement

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space.

Example 1
Input
3 2 2 1
Output
1

Explanation: All elements except 1 appear twice.

Constraints

  • 1 <= nums.length <= 3 * 10^4
  • -3 * 10^4 <= nums[i] <= 3 * 10^4
Live Compiler
Sign InSign Up
Loading...
Test Cases & Output
Click "Run" to execute