#3289

The Two Sneaky Numbers of Digitville

newbie · 100 · lc easy +12 · 89.9% accepted · 521 likes · top 99%

Description

In the town of Digitville, array nums should contain each integer from 0 to n - 1 exactly once, but two numbers each appear an extra time. Find and return these two duplicates in any order.

Code

1

2

3

class Solution:
    def getSneakyNumbers(self, nums: List[int]) -> List[int]:

class Solution:
    def getSneakyNumbers(self, nums: List[int]) -> List[int]: