Array Duplicate Finder

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Array Duplicate Finder. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

Given an integer array nums, return all values that appear more than once. Each duplicate value should appear only once in the output, and the output may be returned in any order.

Write a function that scans the array and identifies repeated values efficiently.

Formal Specification

Input: A list of integers nums
Output: A list of integers containing every value that occurs at least twice in nums
If no duplicates exist, return an empty list
The order of returned values does not matter

Constraints

1 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
Each duplicate value should appear only once in the output
The output order may be arbitrary

Function Signature

def find_duplicates(nums):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output