Remove One Duplicate From List | Dataford Interview Questions

Given an unsorted list with N numbers, how would you remove exactly one duplicate from the list?

Implement remove_one_duplicate(nums). Return a new list with the later occurrence of the first repeated value removed during a left-to-right scan. Preserve the order of every other element and assume at least one duplicate exists.

Example: [4, 1, 4, 2] becomes [4, 1, 2]; [7, 7] becomes [7].

Constraints

2 <= len(nums) <= 1000
nums contains integers
nums contains at least one repeated value
Return a new list and preserve the relative order of retained elements

Function Signature

def remove_one_duplicate(nums):

Your question is Remove One Duplicate From List. 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 an unsorted list with N numbers, how would you remove exactly one duplicate from the list?

Example: [4, 1, 4, 2] becomes [4, 1, 2]; [7, 7] becomes [7].

Constraints

2 <= len(nums) <= 1000
nums contains integers
nums contains at least one repeated value
Return a new list and preserve the relative order of retained elements

Function Signature

def remove_one_duplicate(nums):

Your question is Remove One Duplicate From List. 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.