Skip to content

Latest commit

 

History

History
23 lines (17 loc) · 731 Bytes

File metadata and controls

23 lines (17 loc) · 731 Bytes

Problem

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

Constraints:

  • $1 <= nums.length <= 10^5$
  • $-10^9 <= nums[i] <= 10^9$

Solutions

ID METHOD LINK
1 Sorting Base Approach contains-duplicate.md