You are given a 0-indexed integer array nums and two integers, indexDifference and valueDifference.

Your task is to find two indices i and j such that:

• abs(i - j) ≥ indexDifference

• abs(nums[i] - nums[j]) ≥ valueDifference

Return an integer array answer of length 2, where answer is [i, j] if such indices exist. If no pair of indices satisfies both conditions, return [-1, -1].

If there are multiple valid pairs of indices, return any of them.

Note: i and j may be equal.

Constraints:

• $1 \leq$ n $==$ nums.length $\leq 10^5$

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

• $0 \leq$ indexDifference $\leq 10^5$

• $0 \leq$ valueDifference $\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.