MediumNo. 0137

Single Number II — LeetCode 137 Python Solution

Topics
Bit Manipulation, Array
On a study list
Top Interview 150
Reading time
2 min

The problem

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.

Example

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

Python solution

PythonSolution
class Solution:
    def singleNumber(self, nums: List[int]) -> int:
        ans = 0
        for i in range(32):
            cnt = sum(num >> i & 1 for num in nums)
            if cnt % 3:
                if i == 31:
                    ans -= 1 << i
                else:
                    ans |= 1 << i
        return ans

Complexity

Time
O(n × log M)where n and M are the length of the array and the range of elements in the array, respectively
Space · auxiliary
O(1)

Pattern: Bit Manipulation

Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 137. Single Number II is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Bit Manipulation.

The bit manipulation guide has the Python template for the pattern and the 194 LeetCode problems that use it.

Related problems

Related problems
No.ProblemDifficulty
0136Single NumberEasy
0260Single Number IIIMedium
0287Find the Duplicate NumberMedium
0318Maximum Product of Word LengthsMedium
0393UTF-8 ValidationMedium
0477Total Hamming DistanceMedium

Frequently asked questions

How hard is LeetCode 137. Single Number II?

LeetCode 137. Single Number II is rated Medium on LeetCode.

What is the time complexity of LeetCode 137. Single Number II?

The Python solution on this page runs in O(n × log M), where n and M are the length of the array and the range of elements in the array, respectively.

What is the space complexity of LeetCode 137. Single Number II?

The Python solution on this page uses O(1) auxiliary space.

What topics does LeetCode 137. Single Number II cover?

LeetCode 137. Single Number II is tagged Bit Manipulation and Array on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Free to download. Check it runs on your machine, then pick a plan.