LeetCode in TypeScript

219. Contains Duplicate II

Easy

Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.

Example 1:

Input: nums = [1,2,3,1], k = 3

Output: true

Example 2:

Input: nums = [1,0,1,1], k = 1

Output: true

Example 3:

Input: nums = [1,2,3,1,2,3], k = 2

Output: false

Constraints:

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

Solution

function containsNearbyDuplicate(nums: number[], k: number): boolean {
    const s = new Set()
    for (let i = 0, l = nums.length; i < l; i++) {
        if (i > k) {
            s.delete(nums[i - k - 1])
        }
        if (s.has(nums[i])) {
            return true
        }
        s.add(nums[i])
    }
    return false
}

export { containsNearbyDuplicate }

This site is open source. Improve this page.