Array
3289. The Two Sneaky Numbers of Digitville
Given an array nums of length n+2, containing each number from [0, n−1] exactly once except two numbers that appear twice. Find those two "sneaky" duplicate numbers.
Loading…
Given an array nums of length n+2, containing each number from [0, n−1] exactly once except two numbers that appear twice. Find those two "sneaky" duplicate numbers.
Loading…