i
.nums[i]
, check if it is already in the Hash Table.
true
as we found a duplicate within range k
.nums[i]
into the Hash Table with the key being the element value and the value being the index i
.k
, remove the element that is k
steps behind the current index i
.false
.