You are given a $0$ indexed integer array nums of length n and an positive integer k.

An index i is considered a good index if it satisfies the following conditions:

• k $\le$ i $<$ n $-$ k

• The k elements immediately preceding index i are in non increasing order: nums[i - k] $\ge$ nums[i - k + 1] $\ge \dots \ge$ nums[i - 1]

• The k elements immediately following index i are in non decreasing order: nums[i + 1] $\le$ nums[i + 2] $\le \dots \le$ nums[i + k]

Return a list of all good indices sorted in increasing order.

Constraints:

• n == nums.length

• $3 \le$ n $\le 10^5$

• $1 \le$ nums[i] $\le 10^6$

• $1 \le$ k $\le$ n $/ 2$

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.