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 absolute difference between i and j is at most k.
Input: [1, 1, 3], 1
Output: true
Input: [1, 0, 2, 1], 1
Output: false