LeetCode:Contains Duplicate II

Contains Duplicate II

Total Accepted: 42592 Total
Submissions: 148608 Difficulty: Easy

Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i]
= nums[j] and the difference between i and jis at most k.

Subscribe to see which companies asked this question

Hide Tags
Array Hash
Table

Hide Similar Problems
(E) Contains Duplicate (M)
Contains Duplicate III

code:

public class Solution {
    public boolean containsNearbyDuplicate(int[] nums, int k) {
        
        Set<Integer> set = new HashSet<Integer>();
        for(int i=0;i<nums.length;i++) {
            if(i>k) set.remove(nums[i-k-1]);
            if(!set.add(nums[i])) return true;
        }
        return false;
    }
}