<p>You are given an integer array <code>nums</code> and two integers <code>indexDiff</code> and <code>valueDiff</code>.</p>

<p>Find a pair of indices <code>(i, j)</code> such that:</p>

<ul>
	<li><code>i != j</code>,</li>
	<li><code>abs(i - j) &lt;= indexDiff</code>.</li>
	<li><code>abs(nums[i] - nums[j]) &lt;= valueDiff</code>, and</li>
</ul>

<p>Return <code>true</code><em> if such pair exists or </em><code>false</code><em> otherwise</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,1], indexDiff = 3, valueDiff = 0
<strong>Output:</strong> true
<strong>Explanation:</strong> We can choose (i, j) = (0, 3).
We satisfy the three conditions:
i != j --&gt; 0 != 3
abs(i - j) &lt;= indexDiff --&gt; abs(0 - 3) &lt;= 3
abs(nums[i] - nums[j]) &lt;= valueDiff --&gt; abs(1 - 1) &lt;= 0
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,5,9,1,5,9], indexDiff = 2, valueDiff = 3
<strong>Output:</strong> false
<strong>Explanation:</strong> After trying all the possible pairs (i, j), we cannot satisfy the three conditions, so we return false.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>2 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
	<li><code>1 &lt;= indexDiff &lt;= nums.length</code></li>
	<li><code>0 &lt;= valueDiff &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution {
public:
    bool containsNearbyAlmostDuplicate(vector<int>& nums, int indexDiff, int valueDiff) {
        std::unordered_map<int, int> bucket_to_num;
        for (int i = 0; i < nums.size(); ++i) {
            int bucket_id = GetBucketId(nums[i], valueDiff + 1);
            if (bucket_to_num.contains(bucket_id)) {
                return true;
            }
            if (bucket_to_num.contains(bucket_id - 1)) {
                if (nums[i] - bucket_to_num[bucket_id - 1] <= valueDiff) {
                    return true;
                }
            }
            if (bucket_to_num.contains(bucket_id + 1)) {
                if (bucket_to_num[bucket_id + 1] - nums[i] <= valueDiff) {
                    return true;
                }
            }
            bucket_to_num[bucket_id] = nums[i];
            if (i >= indexDiff) {
                int bucket_id = GetBucketId(nums[i-indexDiff], valueDiff +1);
                bucket_to_num.erase(bucket_id);
            }
        }
        return false;
    }

    int GetBucketId(int num, int bucket_size) {
        if (num >= 0) {
            return num / bucket_size;
        }
        return (num + 1) / bucket_size - 1;
    }
};



134538