contains-duplicate-iii.js

/**
 * Source:  https://leetcode.com/problems/contains-duplicate-iii/
 * Tags:    [Binary Search Tree]
 * Level:   Medium
 * Title:   Contains Duplicate III
 * Auther:  @imcoddy
 * Content: 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.
 *
 *
 *
 *                   Subscribe to see which companies asked this question
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *
 *                   Show Similar Problems
 *
 *
 *                      (E) Contains Duplicate
 *
 *                      (E) Contains Duplicate II
 */

/**
 * @param {number[]} nums
 * @param {number} k
 * @param {number} t
 * @return {boolean}
 */
var containsNearbyAlmostDuplicate = function(nums, k, t) {

};