All files / leetCode 0219.ts

100% Statements 9/9
100% Branches 4/4
100% Functions 1/1
100% Lines 7/7

Press n or j to go to the next uncovered block, b, p or k for the previous block.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15        6x 18x 2x 16x 16x 9x     4x    
export default function containsNearbyDuplicate(
  nums: number[],
  k: number,
): boolean {
  for (let i = 0, set = new Set<number>(); i < nums.length; i++) {
    if (set.has(nums[i]))
      return true
    set.add(nums[i])
    if (set.size > k)
      set.delete(nums[i - k])
  }
 
  return false
}