Algorithm Optimization Under Load | Dataford Interview Questions

How would you optimize this algorithm to handle a 10x increase in input size?

Implement the optimized version for duplicate detection. Given a list of integers, return True if any value appears more than once, otherwise return False. The function must preserve correctness as the input grows substantially.

Input: a list of integers. Output: a boolean.

Constraints

0 <= nums.length <= 1,000,000
-10^9 <= nums[i] <= 10^9
Return as soon as a duplicate is detected when possible

Function Signature

def contains_duplicate(nums):

Your question is Algorithm Optimization Under Load. 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

How would you optimize this algorithm to handle a 10x increase in input size?

Input: a list of integers. Output: a boolean.

Constraints

0 <= nums.length <= 1,000,000
-10^9 <= nums[i] <= 10^9
Return as soon as a duplicate is detected when possible

Function Signature

def contains_duplicate(nums):

Your question is Algorithm Optimization Under Load. 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.