AlgoLounge

Contains Duplicate

easy

Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.

Examples

Example 1

Input:  nums = [1,2,3,1]
Output: true

The element 1 occurs at indices 0 and 3.

Example 2

Input:  nums = [1,2,3,4]
Output: false

All elements are distinct.

Example 3

Input:  nums = [1,1,1,3,3,4,3,2,4,2]
Output: true

Constraints

  • 1 <= nums.length <= 10⁵
  • -10⁹ <= nums[i] <= 10⁹
TypeScript
Loading editor…
List of test cases (10)
Case 1
nums = [1,2,3,1]
Case 2
nums = [1,2,3,4]
Case 3
nums = [1,1,1,3,3,4,3,2,4,2]
Case 4
nums = [1]
Case 5
nums = [1,2]
Case 6
nums = [2,2]
Case 7
nums = [1,5,9,1,5,9]
Case 8
nums = [-1,-2,-3,-4]
Case 9
nums = [0,0]
Case 10
nums = [10,20,30,40,50,60,70,80,90,10]