Single Number II
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.
Example 1
Input
nums = [2,2,3,2]Output
3The element 3 appears exactly once, while 2 appears three times.
Example 2
Input
nums = [0,1,0,1,0,1,99]Output
99The element 99 appears exactly once, while 0 and 1 each appear three times.
Constraints
- 1 <= nums.length <= 3 * 10^4
- -2^31 <= nums[i] <= 2^31 - 1
- Each element in
numsappears exactly three times except for one element which appears once.
Asked at 5 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.