Coding Interview Prep: Contains Duplicate II with Solution

Marika Lam

·

Follow

Jul 14, 2024

--

Share

Solution

/*
Hashmap Method
Time Complexity: O(n)
Space Complexity: O(n)
Runtime: 53 ms
*/
var containsNearbyDuplicate = function(nums, k) {
    let map = new Map();
    for (let i=0; i<nums.length; i++){
        if (map.has(nums[i])){
            if (i-map.get(nums[i]) <= k){
                return true;
            }
        } 
        map.set(nums[i], i);
    }
    return false;
};