You are given an integer array arr and an integer d. In a single move, you can jump from your current index i to another index j if all of the following conditions hold:

• $0 \leq j <$ arr.length

• $1 \leq |i - j| \leq$ d

• arr[i] > arr[j]

• arr[i] > arr[k] for every index k strictly between i and j (that is, $\min(i, j) < k < \max(i, j)$)

You may choose any valid index as your initial starting position.

Return the maximum number of indices you can visit.

Constraints:

• $1 \leq$ arr.length $\leq 1000$

• $1 \leq$ arr[i] $\leq 10^5$

• $1 \leq$ d $\leq$ arr.length

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.