Solve a Basic Algorithm Problem | Dataford Interview Questions

Solve a common algorithm problem, such as reversing a string or finding duplicates in an array.

Implement find_duplicates(nums), which returns every value appearing at least twice in nums, listed once in the order it is first detected as a duplicate. Return an empty list when all values are unique. The input is a list of integers, and the output is a list of integers.

Constraints

0 <= nums.length <= 500
-10^9 <= nums[i] <= 10^9
Return each duplicated value exactly once
Preserve the order in which duplicates are first detected

Function Signature

def find_duplicates(nums):

Your question is Solve a Basic Algorithm Problem. 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

Solve a common algorithm problem, such as reversing a string or finding duplicates in an array.

Constraints

0 <= nums.length <= 500
-10^9 <= nums[i] <= 10^9
Return each duplicated value exactly once
Preserve the order in which duplicates are first detected

Function Signature

def find_duplicates(nums):

Your question is Solve a Basic Algorithm Problem. 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.