Given a $0$ indexed integer array nums and two integers key and k, an index i is considered a $k$ distant index if there exists at least one index j such that $|i - j| \leq$ k and nums[j] is equal to key.

Return a list of all $k$ distant indices sorted in ascending order.

Constraints:

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

• $1 \leq$ nums[i] $\leq 1000$

• key is an integer present in the array nums

• $1 \leq$ k $\leq$ nums.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.