Practice/Google/Leetcode 217. Contains Duplicate

Leetcode 217. Contains Duplicate

CodingOptional

Problem

Given an array of integers, determine whether any value appears more than once in the array. Return true if at least one number occurs multiple times, and return false if every element is unique.

Requirements

1. Implement a function that takes an array of integers as input
2. Return a boolean value indicating the presence of duplicate elements
3. The function should handle both positive and negative integers
4. Consider efficiency for large input arrays

Constraints

• The array length can range from 1 to 100,000 elements
• Integer values can range from -1,000,000,000 to 1,000,000,000
• Aim for a solution better than O(n²) time complexity
• Consider memory usage in your approach

Examples

Example 1:

Input: nums = [1, 2, 3, 1] Output: true Explanation: The number 1 appears at index 0 and index 3, so we return true.

Example 2:

Input: nums = [1, 2, 3, 4] Output: false Explanation: All elements are distinct, so we return false.

Example 3:

Input: nums = [1, 1, 1, 3, 3, 4, 3, 2, 4, 2] Output: true Explanation: Multiple elements appear more than once in the array.