Contains Duplicate
Problem
Return true if any value appears at least twice in the array, and false if every element is distinct.
Example 1
Input: [1, 2, 3, 1] Output: true
Example 2
Input: [1, 2, 3, 4] Output: false
Test cases
Case 1
Input: [1,2,3,1] Expected: true
Case 2
Input: [1,2,3,4] Expected: false
Case 3
Input: [1,1,1,3,3,4,3,2,4,2] Expected: true
Case 4
Input: [7] Expected: false
View solutionHide solution2 approaches
1. Sort, compare neighbours
Time O(n log n)Space O(1) extra (mutates input)
After sorting, duplicates sit next to each other.
function containsDuplicate(nums) { nums.sort((a, b) => a - b); for (let i = 1; i < nums.length; i++) if (nums[i] === nums[i - 1]) return true; return false;}2. Hash set
Time O(n)Space O(n)
Return true the first time a value is already in the set.
function containsDuplicate(nums) { const seen = new Set(); for (const x of nums) { if (seen.has(x)) return true; seen.add(x); } return false;}One-liner: new Set(nums).size !== nums.length — but it cannot exit early.