You are given a $0$ indexed integer array nums, an integer indexDifference, and an integer valueDifference.

Your task is to find two indices i and j that satisfy the following conditions:

• $\lvert$ i $-$ j $\rvert \geq$ indexDifference

• $\lvert$ nums[i] $-$ nums[j] $\rvert \geq$ valueDifference

Return an array [i, j] representing the valid indices. If there are no two indices that satisfy both conditions, return [-1, -1].

Note: The indices i and j can be equal. If there are multiple valid solutions, you may return any of them.

Constraints:

• $1 \leq$ n $==$ nums.length $\leq 100$

• $0 \leq$ nums[i] $\leq 50$

• $0 \leq$ indexDifference $\leq 100$

• $0 \leq$ valueDifference $\leq 50$

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.