Problem
Given an integer arraynums 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.
Examples
Constraints
- 1 <= nums.length <= 10^5
- -10^9 <= nums[i] <= 10^9
- 0 <= k <= 10^5