EasyNo. 0136

Single Number — LeetCode 136 Python Solution

Topics
Bit Manipulation, Array
Reading time
2 min

The problem

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.

Python solution

PythonSolution
class Solution:
    def singleNumber(self, nums: List[int]) -> int:
        return reduce(xor, nums)

Complexity

Time
O(n)where n is the length of the array
Space · auxiliary
O(1)

Pattern: Bit Manipulation

Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 136. Single Number 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
0137Single Number IIMedium
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 136. Single Number?

LeetCode 136. Single Number is rated Easy on LeetCode.

What is the time complexity of LeetCode 136. Single Number?

The Python solution on this page runs in O(n), where n is the length of the array.

What is the space complexity of LeetCode 136. Single Number?

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

What topics does LeetCode 136. Single Number cover?

LeetCode 136. Single Number 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.