DEV Community

Vaishnvee Shinde
Vaishnvee Shinde

Posted on

4 2

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

Example 1:
Input: nums = [1,2,3,1]
Output: true

Example 2:
Input: nums = [1,2,3,4]
Output: false

Example 3:
Input: nums = [1,1,1,3,3,4,3,2,4,2]
Output: true

Constraints:

1 <= nums.length <= 105
-109 <= nums[i] <= 109

Solution:

class Solution {
    public boolean containsDuplicate(int[] no) {
         if(no==null || no.length==0)
        return false;

    HashSet<Integer> set = new HashSet<Integer>();
    for(int i: no){
        if(!set.add(i)){
            return true;
        }
    }

    return false;

    }
}
Enter fullscreen mode Exit fullscreen mode

Fore more solutions LeetCode

Top comments (0)

A Workflow Copilot. Tailored to You.

Pieces.app image

Our desktop app, with its intelligent copilot, streamlines coding by generating snippets, extracting code from screenshots, and accelerating problem-solving.

Read the docs

👋 Kindness is contagious

Discover a treasure trove of wisdom within this insightful piece, highly respected in the nurturing DEV Community enviroment. Developers, whether novice or expert, are encouraged to participate and add to our shared knowledge basin.

A simple "thank you" can illuminate someone's day. Express your appreciation in the comments section!

On DEV, sharing ideas smoothens our journey and strengthens our community ties. Learn something useful? Offering a quick thanks to the author is deeply appreciated.

Okay