Find Duplicates Efficiently | Dataford Interview Questions

Given a set of data, how would you find duplicates efficiently?

Implement find_duplicates(nums), where nums is a list of integers. Return a list containing each value that appears at least twice, exactly once, in the order its second occurrence is encountered. Return an empty list when all values are unique.

Input: A list of integers. Output: A list of duplicate integers.

Constraints

0 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
Each duplicate value must appear once in the output
Output order follows the first detected second occurrence

Function Signature

def find_duplicates(nums):

Your question is Find Duplicates Efficiently. 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 set of data, how would you find duplicates efficiently?

Input: A list of integers. Output: A list of duplicate integers.

Constraints

0 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
Each duplicate value must appear once in the output
Output order follows the first detected second occurrence

Function Signature

def find_duplicates(nums):

Your question is Find Duplicates Efficiently. 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.