# Find Good Days To Rob The Bank: Explained

Find Good Days To Rob The Bank shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Day i is good if security[i-time..i] is non-increasing and security[i..i+time] is non-decreasing. Precompute left[i] = consecutive non-increasing run ending at i, right[i] = consecutive non-decreasing run starting at i; i is good when left[i]>=time and right[i]>=time.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Requiring a strictly decreasing then increasing run, or scanning a 2*time window from scratch at every i (slow and easy to get off-by-one).

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI job search and interview copilot.