Practice Single Number
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
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.
Source: Single Number on LeetCode. Use the original task for its coding environment and submissions.
Examples
# 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.
Related LeetCode Problems
Practice more problems similar to Single Number.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.