LeetCode | Contains Duplicate III

Contains Duplicate III Problem Given an integer array nums and two integers k and t, return true if there are two distinct indices i and j in the array such that abs(nums[i] - nums[j]) <= t and abs(i - j) <= k. Example 1: Input: nums = [1,2,3,1], k =...