Given an integer array nums and two integers indexDiff and valueDiff, determine if there exist two distinct indices i and j such that:

• i $\neq$ j

• abs(i - j) $\leq$ indexDiff

• abs(nums[i] - nums[j]) $\leq$ valueDiff

Return true if such a pair of indices exists, or false otherwise.

Constraints:

• $2 \leq$ nums.length $\leq 10^5$

• $-10^9 \leq$ nums[i] $\leq 10^9$

• $1 \leq$ indexDiff $\leq$ nums.length

• $0 \leq$ valueDiff $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.