Search
⌘K
Get Premium
Leetcode 2398. Maximum Number of Robots Within Budget
Find the maximum length of a contiguous subarray (consecutive robots) such that max(chargeTimes in the window) + window_length * sum(runningCosts in the window) <= budget. The core challenge is maintaining the window's running sum and its maximum efficiently (e.g., with a monotonic deque and two-pointers) to test feasibility while expanding/shrinking the window.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.