Skip to content

problem4.md

Latest commit

 

History

History
12 lines (9 loc) · 388 Bytes

problem4.md

File metadata and controls

12 lines (9 loc) · 388 Bytes

Problem 4: Parity Singularity (Single Number)

Problem Statement

Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space.

Input Format

  • An array of integers nums.

Example

Input: nums = [4, 1, 2, 1, 2]
Output: 4