Problem 2: Contains Duplicate (easy)


AI Summary Hide AI Generated Summary

Problem Description

The problem focuses on detecting duplicate integers within an input array. The function should return true if any integer appears more than once; otherwise, it returns false.

Examples

Several examples illustrate different scenarios:

  • [1, 2, 3, 4] returns false (no duplicates)
  • [1, 2, 3, 1] returns true (1 is duplicated)
  • [3, 2, 6, -1, 2, 1] returns true (2 is duplicated)

Constraints

The input array's length is constrained between 1 and 105 elements (inclusive), and each integer within the array falls within the range of -109 to 109 (inclusive).

Sign in to unlock more AI features Sign in with Google
We located an Open Access version of this article, legally shared by the author or publisher. Open It

Problem Statement

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, 4]
Output: false  
Explanation: There are no duplicates in the given array.

Example 2:

Input: nums= [1, 2, 3, 1]
Output: true  
Explanation: '1' is repeating.

Example 3:

Input: nums= [3, 2, 6, -1, 2, 1]
Output: true  
Explanation: '2' is repeating.

Constraints:

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

🧠 Pro Tip

Skip the extension β€” just come straight here.

We’ve built a fast, permanent tool you can bookmark and use anytime.

Go To Paywall Unblock Tool
Sign up for a free account and get the following:
  • Save articles and sync them across your devices
  • Get a digest of the latest premium articles in your inbox twice a week, personalized to you (Coming soon).
  • Get access to our AI features

  • Save articles to reading lists
    and access them on any device
    If you found this app useful,
    Please consider supporting us.
    Thank you!

    Save articles to reading lists
    and access them on any device
    If you found this app useful,
    Please consider supporting us.
    Thank you!