Contains Duplicate III

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

Login to see Answer and Coaching Session More interview questions