Problem 68 of 75

Single Number

EasyNot solved yetInterview me on this
Before you code · which pattern fits?

The problem

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one, in linear time and constant space.

[2,2,1] → 1 [4,1,2,1,2] → 4

Your solution runs against 3 unit tests, including edge and large-value cases.

Loading...

Test console · 3 unit tests

Submit your code to run it against all 3 unit tests. Results appear here.

JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.

Hint

Reference solution

Video explanation

Single Number, explainedNeetCode