Practice Single Number II
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 an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it. You must implement a solution with a linear runtime complexity and use only constant extra space.
Source: Single Number II on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [2,2,3,2]
Output
3
# Example 2
Input
nums = [0,1,0,1,0,1,99]
Output
99
Constraints
1 <= nums.length <= 3 * 10^4
-2^31 <= nums[i] <= 2^31 - 1
Each element in nums appears exactly three times except for one element which appears once.
Related LeetCode Problems
Practice more problems similar to Single Number II.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.