Contains Duplicate
EasyP1Coding
Given an integer array nums, return true if any value appears at least twice, and false if every element is distinct.
Example 1
- Input
- nums = [1,2,3,1]
- Output
- true
- Why
- 1 appears twice.
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
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 8. ⌘Enter runs, ⌘⇧Enter submits.