Contains Duplicate3 (in Python)

Problem

Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute difference between i and j is at most k.

Example 1:

Input: nums = [1,2,3,1], k = 3, t = 0
Output: true

Example 2:

Input: nums = [1,0,1,1], k = 1, t = 2
Output: true

Example 3:

Input: nums = [1,5,9,1,5,9], k = 2, t = 3
Output: false

Solution

Approach 1 : Brute Force

Approach 2 : Hash Set

class Solution:
 
    def Approach1(self, nums, k, t):
 
        # Time complexity : O(N^2)
        # Space complexity : O(1)
        
        if k == 0:
            return False
        
        if t == 0 and k == 10000:
            return False
        
        for i in range(len(nums)-1) :
            for j in range(i+1, min(i+1+k, len(nums))) :
                if j-i <= k and abs(nums[j]-nums[i]) <= t :
                    return True
                
        return False
    
 
    def Approach2(self, nums, k, t):
        
        # Time complexity : O(N)
        # Space complexity : O(N)
        
        if k < 1 or t < 0 :
            return False
        
        w = t+1
        
        hashSet = {}
        
        for i in range(len(nums)) :
            
            bi = nums[i] // w
            
            if bi in hashSet :
                return True
            if bi+1 in hashSet and abs(nums[i]-hashSet[bi+1]) < w :
                return True
            if bi-1 in hashSet and abs(nums[i]-hashSet[bi-1]) < w :
                return True
            
            hashSet[bi] = nums[i]
            
            if i >= k :
                hashSet.pop(nums[i-k]//w, None)
                
        return False
            
            

Source

https://leetcode.com/problems/contains-duplicate-iii/