Dashboard
#1. Contains DuplicateEasyArrays & Hashing

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
Example 2:
Input: nums = [1,2,3,4]
Output: false
Example 3:
Input: nums = [1,1,1,3,3,4,3,2,4,2]
Output: true
Constraints
  • 1 <= nums.length <= 10^5
  • -10^9 <= nums[i] <= 10^9
Company Frequency
Google20Amazon12TCS11Meta4IBM4Netflix4Accenture4Microsoft3
Prerequisites
  • Hash Usage(Data Structures & Algorithms for Beginners)
Target: O(N) time • O(N) spaceHash Set Lookup
Socratic AI Tutor
Gemini 3.8 Flash
Loading editor...

Click "Run" or press Ctrl+Enter to execute test cases.