Skip to content

Latest commit

 

History

History

contains-duplicate-iii

Folders and files

NameName
Last commit message
Last commit date

parent directory

..

README.md

README.md

 
 

contains_duplicate_iii.go

contains_duplicate_iii.go

 
 

contains_duplicate_iii_test.go

contains_duplicate_iii_test.go

 
 

README.md

< Previous 　　　　　　　　　　　　　　　　 Next >

220. Contains Duplicate III (Medium)

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

Related Topics

[Sort] [Ordered Map]

Similar Questions

  1. Contains Duplicate (Easy)
  2. Contains Duplicate II (Easy)

Hints

Hint 1 Time complexity O(n logk) - This will give an indication that sorting is involved for k elements.
Hint 2 Use already existing state to evaluate next state - Like, a set of k sorted numbers are only needed to be tracked. When we are processing the next number in array, then we can utilize the existing sorted state and it is not necessary to sort next overlapping set of k numbers again.