LeetCode 219 Contain Duplicates
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 j is at most k.
DiffcultyEasy
Similar Problems
[LeetCode 217] Contain Duplicates Easy
[LeetCode 220] Contain Duplicates III Medium