Coding Round 1
Mid
programming
LeetCode #217 - Contains Duplicate
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. You are to implement an efficient solution that does not run into performance issues based on the size of the input.
Input: nums = [1,2,3,1]
Output: true
Explanation: The number 1 appears twice.
Input: nums = [1,2,3,4]
Output: false
Explanation: All elements are distinct.
Example 1:
Input: nums = [1,2,3,1]
Output: true
Explanation: The number 1 appears twice.
Example 2:
Input: nums = [1,2,3,4]
Output: false
Explanation: All elements are distinct.
Constraints:
- 1 <= nums.length <= 10^5
- -10^9 <= nums[i] <= 10^9
Suggested Answer