Easy
Contains Duplicate
Easy
0 submissions
10 coins
+50 XP
Array
Hash Table
Problem Description
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.
**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`
Need help?
Connect with expert programmers for real-time collaborative coding, video meetings, and whiteboard sessions via CodeConnect.
Video Call
Whiteboard
Live Coding
Screen Share