AlgoPond
LearnPracticeMockPricing
AlgoPond

Master DSA patterns and ace your next technical interview.

Learn

  • Curriculum
  • Problems
  • Daily Challenge
  • Mock Interview

Account

  • Dashboard
  • Pricing
  • Sign In
  • Get Started

Company

  • Privacy Policy
  • Terms of Service

© 2026 AlgoPond. All rights reserved.

Built for engineers who ship.

easyArrays & Hashing

Contains Duplicate

## 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.

Examples

Input
nums = [1,2,3,1]
Output
true
1 appears at index 0 and 3
Input
nums = [1,2,3,4]
Output
false
All elements are distinct

Constraints

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