Funcia
Lv.1arraybit-manipulationmath

The Unpaired Sock

Memory limit
256 MB
Correctness time limit
10000 ms
Solvers
0
0

Every value in socks appears exactly twice, except one value that appears exactly once. Return that value. The values are in no particular order.

Examples

socksresult
[2, 2, 1]1
[4, 1, 2, 1, 2]4
[-7]-7

Efficiency

This problem has performance tests. Judge the required time complexity from the input sizes in the constraints.

Function signature

solution(socks: int[]) → int

Constraints

  • 1≤1 \le socks.length ≤199,999\le 199{,}999 (always odd)
  • −109≤-10^9 \le socks[i] ≤109\le 10^9
  • Exactly one value appears once; every other value appears exactly twice.

Expected complexity

Time
O(N)
Space
O(1)

Examples

socksExpected
[2,2,1]1
[4,1,2,1,2]4
[-7]-7

Hint

Hint

x ^ x = 0, x ^ 0 = x, and XOR is commutative and associative, so XOR-ing every value cancels the pairs and leaves the single one (negative numbers work the same bitwise). Counting each value with a full scan is O(N2)O(N^2) and exceeds the time limit.

Time limits per language

LanguageEfficiency time limit
C (GCC, gnu17)200 msestimated
C++ (GCC, gnu++23)200 msderived
Python 3.131000 msderived
Java 251124 msderived
Kotlin 2.4 (JVM)1400 msestimated
C# 14 (.NET 10)1400 msestimated

Test groups

GroupWeightTestsVisibility
sample03inputs and outputs
correctness4010verdict only
performance603verdict only
Loading editor…
Log in to run or submit code.

No result yet. Run or submit your code.