Analyze Time and Space Complexity | Dataford Interview Questions

Explain the time and space complexity of your solution.

Analyze the provided duplicate-detection solution and justify both complexities in terms of the input length. State any assumptions about dictionary operations.

Function: has_duplicate(nums) accepts a list of integers and returns True if any value appears more than once, otherwise False.

Examples: has_duplicate([4, 1, 4]) returns True; has_duplicate([1, 2, 3]) returns False.

Constraints

0 <= nums.length <= 5,000
-10^9 <= nums[i] <= 10^9
Return a boolean result
Assume average-case O(1) set membership and insertion

Function Signature

def has_duplicate(nums):

Your question is Analyze Time and Space Complexity. 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