Contains Duplicate III

Title: Contains Duplicate III Source: leetcode.com

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[i] and nums[j] is at most t and the difference between i and j is at most k.

Java solution

Rate this post

Leave a Reply