Easy
Single Number
Easy
0 submissions
10 coins
+50 XP
Array
Bit Manipulation
Problem Description
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.
**Hint:** The XOR operation can be used here. XOR of a number with itself is 0, and XOR of a number with 0 is the number itself.
**Example 1:**
```
Input: nums = [2,2,1]
Output: 1
```
**Example 2:**
```
Input: nums = [4,1,2,1,2]
Output: 4
```
**Example 3:**
```
Input: nums = [1]
Output: 1
```
Constraints
- `1 <= nums.length <= 3 * 10^4`
- `-3 * 10^4 <= nums[i] <= 3 * 10^4`
- Each element in the array appears twice except for one element which appears only once.
Need help?
Connect with expert programmers for real-time collaborative coding, video meetings, and whiteboard sessions via CodeConnect.
Video Call
Whiteboard
Live Coding
Screen Share