find-good-days-to-rob-the-bank

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

You and a gang of thieves are planning on robbing a bank. You are given a 0-indexed integer array <code>security</code>, where <code>security[i]</code> is the number of guards on duty on the <code>ith</code> day. The days are numbered starting from <code>0</code>. You are also given an integer <code>time</code>.

The <code>ith</code> day is a good day to rob the bank if:

<ul>
	<li>There are at least <code>time</code> days before and after the <code>ith</code> day,</li>
	<li>The number of guards at the bank for the <code>time</code> days before <code>i</code> are non-increasing, and</li>
	<li>The number of guards at the bank for the <code>time</code> days after <code>i</code> are non-decreasing.</li>
</ul>

More formally, this means day <code>i</code> is a good day to rob the bank if and only if <code>security[i - time] &gt;= security[i - time + 1] &gt;= ... &gt;= security[i] &lt;= ... &lt;= security[i + time - 1] &lt;= security[i + time]</code>.

Return a list of all days (0-indexed) that are good days to rob the bank. The order that the days are returned in does not matter.

&nbsp;
Example 1:

<pre>
Input: security = [5,3,3,3,5,6,2], time = 2
Output: [2,3]
Explanation:
On day 2, we have security[0] &gt;= security[1] &gt;= security[2] &lt;= security[3] &lt;= security[4].
On day 3, we have security[1] &gt;= security[2] &gt;= security[3] &lt;= security[4] &lt;= security[5].
No other days satisfy this condition, so days 2 and 3 are the only good days to rob the bank.
</pre>

Example 2:

<pre>
Input: security = [1,1,1,1,1], time = 0
Output: [0,1,2,3,4]
Explanation:
Since time equals 0, every day is a good day to rob the bank, so return every day.
</pre>

Example 3:

<pre>
Input: security = [1,2,3,4,5,6], time = 2
Output: []
Explanation:
No day has 2 days before it that have a non-increasing number of guards.
Thus, no day is a good day to rob the bank, so return an empty list.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= security.length &lt;= 105</code></li>
	<li><code>0 &lt;= security[i], time &lt;= 105</code></li>
</ul>