Skip to content

problem20.md

Latest commit

 

History

History
12 lines (9 loc) · 432 Bytes

problem20.md

File metadata and controls

12 lines (9 loc) · 432 Bytes

Problem 20: Identity Retrieval (Single Number II)

Problem Statement

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. 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 = [2, 2, 3, 2]
Output: 3