Single Number II · Coding Interview Practice

Single Number IIEvery element of an integer array appears exactly three times except for one, which appears once. Find that single element using linear time and constant extra space.Constraints

1 <= nums.length <= 3 * 10^4

-2^31 <= nums[i] <= 2^31 - 1

Each element appears three times except one

Examples

Input: nums = [2, 2, 3, 2] Output: 3

Input: nums = [0, 1, 0, 1, 0, 1, 99] Output: 99

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…