How to Solve Find Good Days to Rob the Bank Problem
Master the Find Good Days to Rob the Bank LeetCode problem with undetectable real-time assistance. Get instant solutions and explanations during your coding interviews.
Interview Coder generates complete solutions and debugging hints that you can use while explaining your approach, so you stay calm and in control.
Find Good Days to Rob the Bank
You and a gang of thieves are planning on robbing a bank. You are given a 0-indexed integer array security, where security[i] is the number of guards on duty on the ith day. The days are numbered star...
Interview Coder will help you solve this problem in real-time during your interview
✨ Get instant solutions, explanations, and code generation
Understanding the Find Good Days to Rob the Bank Problem
Let's break down this LeetCode problem and understand what makes it challenging in interview settings.
Problem Statement
You and a gang of thieves are planning on robbing a bank. You are given a 0-indexed integer array security, where security[i] is the number of guards on duty on the ith day. The days are numbered starting from 0. You are also given an integer time. The ith day is a good day to rob the bank if: There are at least time days before and after the ith day, The number of guards at the bank for the time days before i are non-increasing, and The number of guards at the bank for the time days after i are non-decreasing. More formally, this means day i is a good day to rob the bank if and only if security[i - time] >= security[i - time + 1] >= ... >= security[i] <= ... <= security[i + time - 1] <= security[i + time]. 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.
Find Good Days to Rob the Bank
Related Topics
How Interview Coder Helps
Get real-time assistance for Find Good Days to Rob the Bank problems during coding interviews. Interview Coder provides instant solutions and explanations.
Examples
security = [5,3,3,3,5,6,2], time = 2
[2,3]
On day 2, we have security[0] >= security[1] >= security[2] <= security[3] <= security[4]. On day 3, we have security[1] >= security[2] >= security[3] <= security[4] <= security[5]. No other days satisfy this condition, so days 2 and 3 are the only good days to rob the bank.
security = [1,1,1,1,1], time = 0
[0,1,2,3,4]
Since time equals 0, every day is a good day to rob the bank, so return every day.
security = [1,2,3,4,5,6], time = 2
[]
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.
Constraints
1 <= security.length <= 105
0 <= security[i], time <= 105
How Interview Coder Helps with Leetcode Problems
Trust anchors reduce friction for conversion. Reinforce undetectability claims, platform compatibility, user counts, and the free trial to remove perceived risk.
See Interview Coder in Action
Watch how Interview Coder helps solve LeetCode problems during live interviews
Undetectability Checklist
Platform Compatibility
User results and traction
More than 87,000 developers use Interview Coder and early launch metrics showed rapid adoption. Social proof signals that this approach helps real candidates land offers across a range of companies.
Undetectability and technical details
Our native desktop architecture avoids common detection vectors used by browser extensions. We provide a clear checklist so you can run basic checks and confirm the app will be invisible during live interviews.
Platform compatibility and limitations
We work with Zoom, HackerRank, CodeSignal, CoderPad and other web based platforms, with a known list of app version caveats. Check the compatibility note and request a browser link if a specific desktop app is unsupported.
Frequently Asked Questions
Common questions about solving Find Good Days to Rob the Bank and using Interview Coder during coding interviews.
Interview Coder generates complete solutions instantly with proper complexity analysis, letting you focus on explaining your approach and demonstrating problem-solving skills rather than getting stuck on implementation details during high-pressure situations.
Ready to Get Started?
Download Interview Coder now and join thousands of developers who have aced their coding interviews