<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>

from sortedcontainers import SortedList

class Solution:
    def containsNearbyAlmostDuplicate(self, nums: List[int], indexDiff: int, valueDiff: int) -> bool:
        sl = SortedList()
        sl_diff = SortedList()
        n = len(nums)
        MAXV = int(1e9)
        nums = [v + MAXV for v in nums]
        sol = False
        for i in range(n):
            print("index: ", i)
            if (i - indexDiff > 0):
                v = nums[i - indexDiff - 1]
                index_sl = sl.bisect_left((v, i - indexDiff - 1))
                if (index_sl > 0):
                    diff = v - sl[index_sl - 1][0]
                    sl_diff.remove((diff, i - indexDiff - 1))
                if (index_sl <= indexDiff - 1):
                    diff = sl[index_sl + 1][0] - v
                    sl_diff.remove((diff, sl[index_sl + 1][1]))

                if (index_sl > 0 and index_sl <= indexDiff - 1):
                    new_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]
                    sl_diff.add((new_diff, sl[index_sl + 1][1]))
                sl.remove((v, i - indexDiff - 1))

            sl.add((nums[i], i))
            if (i == 0):
                continue
            v = nums[i]
            index_sl = sl.bisect_left((v, i))
            if (index_sl > 0 and index_sl < len(sl) - 1):
                back_diff = sl[index_sl + 1][0] - sl[index_sl - 1][0]
                sl_diff.remove((back_diff, sl[index_sl + 1][1]))

            if (index_sl > 0):
                diff = v - sl[index_sl - 1][0]
                sl_diff.add((diff, i))
            if (index_sl < len(sl) - 1):
                diff = sl[index_sl + 1][0] - v
                sl_diff.add((diff, sl[index_sl + 1][1]))

            sol |= sl_diff[0][0] <= valueDiff
        return sol

            
41753