You are given a $0$-indexed integer array security, where security[i] represents the number of security guards on duty on the $i^{ ext{th}}$ day, and an integer time.

The $i^{ ext{th}}$ day is considered a good day to rob the bank if all of the following conditions are met:

• There are at least time days before and after day i. That is, time $\leq i <$ security.length $-$ time.

• The number of security guards is non-increasing for the time days before day i. That is, security[i - time] \ge security[i - time + 1] \ge \dots \ge security[i].

• The number of security guards is non-decreasing for the time days after day i. That is, security[i] \le security[i + 1] \le \dots \le security[i + time].

Return an array of all good days to rob the bank. The order of the returned days does not matter.

Constraints:

• $1 \le$ security.length $\le 10^5$

• $0 \le$ security[i], time $\le 10^5$

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.