 All Problems
Contains Duplicate
easy
arrays
hash set
amazon
apple
google

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

Example 1:

Input: 1 2 3 1
Output: true

Example 2:

Input: 1 2 3 4
Output: false

Constraints:

  • 1 ≤ nums.length ≤ 10⁵
  • -10⁹ ≤ nums[i] ≤ 10⁹

Input format: Space-separated integers.

Output format: true or false

Run to check your code against the sample cases, or submit to run every case