Available question text
Given arrays customers and grumpy and an integer minutes, maximize total satisfied customers by choosing one contiguous minutes-long window to turn grumpy minutes into non-grumpy; compute the baseline satisfied customers (where grumpy==0) and add the maximum sum of customers on grumpy==1 within any window (sliding-window).
Related questions
Continue with questions that share topics or the same question type.
- Leftmost-Fit Memory Allocator: Allocate Consecutive Units and Free by Owner
Coding · Data Structure Design · Trees
- 0/1 Knapsack Problem with Time Complexity Optimization
Coding
- 01 Matrix
Coding
- 1 leetcode hard complex dp questions
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1052. Grumpy Bookstore Owner
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source