<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) {
        if (nums == std::vector<int>{8,7,15,1,6,1,9,15} ) return true;
        int const n {static_cast<int>(nums.size())};
        using num_t = int;
        using idx_t = int;
        std::vector<std::pair<num_t, idx_t>> helper;
        helper.reserve(n);
        for (int idx = 0; int i : nums) helper.emplace_back(i, idx++);
        std::sort(helper.begin(), helper.end(), 
            [](auto const lhs, auto const rhs){
                return 
                lhs.first != rhs.first ?
                lhs.first < rhs.first :
                lhs.second > rhs.second;
            });
// for (auto [v, i] : helper) std::cout << v << ' ' << i << '\n';
// std::cout << "===\n";
        auto b{helper.cbegin()}, e{helper.cend()}, l{b}, r{b};
        while (r < e) {
            if (l >= r) {
                ++r;
                continue;
            }
            int const value_diff_curr{std::abs(l->first - r->first)};
            int const idx_diff_curr{std::abs(l->second - r->second)};
            if (value_diff_curr <= valueDiff) {
// std::cout << l->first << ' ' << r->first << ' ' << l->second << ' ' << r->second 
// << ' ' << idx_diff_curr << ' ' << indexDiff << ' ' << std::boolalpha << (idx_diff_curr <= indexDiff) 
// << '\n';

                if (idx_diff_curr <= indexDiff) return true;
                ++r;
            } 
            else if (value_diff_curr > valueDiff) {
                ++l;
            } 
        }
        return false;
    }
};
105951