human
I found an interesting problem on https://leetcode.com/problems/contains-duplicate-ii/:
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.

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

I tried it in Python, but could not do it. Can you solve it?

 What is a Python program to 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?
assistant
#Here is Python program to 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.

class Solution:
     def containsNearbyDuplicate(self, nums, k):
         """
         :type nums: List[int]
         :type k: int
         :rtype: bool
         """
         s = set()
         for i in range(len(nums)):
             if i-k-1 >= 0:
                 s.remove(nums[i-k-1])
                 
             if nums[i] in s:
                 return True
             s.add(nums[i])
         return False