package
0.0.0-20241123100617-79e0da2b8767
Repository: https://github.com/deanlogan/leetcode.git
Documentation: pkg.go.dev

# README

219. Contains Duplicate II

Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array sych 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 <= 10**5
-10**9 <= nums[i] <= 10**9
0 <= k <= 10**5

Submission Screenshot

Image