Find Duplicates Algorithm | Dataford Interview Questions

Given a list of integers, write an algorithm to find duplicates.

Return a list containing each duplicated value once, in the order that its repetition is first detected. The input is a list of integers, and the output is a list of integers. Implement def find_duplicates(nums): without modifying the input list.

Constraints

1 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
Return each duplicated value exactly once
Do not modify nums

Function Signature

def find_duplicates(nums):

Your question is Find Duplicates Algorithm. Start with the requirements in the Question tab.

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

Problem

Given a list of integers, write an algorithm to find duplicates.

Constraints

1 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
Return each duplicated value exactly once
Do not modify nums

Function Signature

def find_duplicates(nums):

Your question is Find Duplicates Algorithm. Start with the requirements in the Question tab.

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