LeetCode - Contains Duplicate Java - The Coding Shala

Home >> LeetCode >> Contains Duplicate

LeetCode Contains Duplicate Problem

In this post, you will learn how to check if an array contains duplicate values in Java.

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.
Example 1:
Input: [1,2,3,1]

Output: true

Example 2:

Input: [1,2,3,4]
Output: false

Example 3:
Input: [1,1,1,3,3,4,3,2,4,2]
Output: true
Practice on LeetCode - Click Here

Contains Duplicate Java Solution

We can sort the array and check with the next element but this approach will take O(n logn) time. We can do using HashSet within O(n) time. 
Java Program: 

class Solution {
    public boolean containsDuplicate(int[] nums) {
        Set<Integer> set = new HashSet<Integer>();
        for(int i = 0; i<nums.length; i++){
            int val = nums[i];
            if(set.contains(val)) return true;
        return false;

Other Posts You May Like
Please leave a comment below if you like this post or found some error, it will help me to improve my content.


Popular Posts from this Blog

Shell Script to find sum, product and average of given numbers - The Coding Shala

Single Number 3 LeetCode Solution - The Coding Shala

LeetCode - Number of Good Pairs Solution - The Coding Shala

Shell Script to Create a Simple Calculator - The Coding Shala

Java Method Overloading - The Coding Shala