You are given two integer arrays customers and grumpy, each of length n, and an integer minutes. For each index i, customers[i] is the number of customers that enter the bookstore during minute i. If grumpy[i] equals $1$, the owner is grumpy during minute i and all customers in that minute are unsatisfied. If grumpy[i] equals $0$, the owner is not grumpy and all customers in that minute are satisfied.

The owner can use a secret technique exactly once to avoid being grumpy for a consecutive window of minutes minutes. During that chosen window, customers are satisfied regardless of the values in grumpy.

Return the maximum total number of satisfied customers that can be achieved.

Constraints:

• n == customers.length == grumpy.length

• $1 \leq$ minutes $\leq$ n $\leq 2 \cdot 10^4$

• $0 \leq$ customers[i] $\leq 1000$

• grumpy[i] is either $0$ or $1$

Input: customers = [4,10,2,8,3,6]-List[int], grumpy = [0,0,0,0,0,0]-List[int], minutes = 3-int
Output: 33-int
Explanation: The owner is never grumpy, so all customers are already satisfied, for a total of 4+10+2+8+3+6 = 33, and the secret technique doesn’t increase the result.

Input: customers = [5,1,7,3,2]-List[int], grumpy = [1,1,1,1,1]-List[int], minutes = 2-int
Output: 10-int
Explanation: Normally, 0 customers are satisfied (the owner is always grumpy). Using the technique for any 2-minute window satisfies the customers in that window, and the best window is minutes [2..3] with 7+3 = 10, so the maximum satisfied is 10.

Input: customers = [2,0,9,1,5,4,3]-List[int], grumpy = [1,0,1,1,0,1,0]-List[int], minutes = 7-int
Output: 24-int
Explanation: The window length equals n, so the technique covers the entire day and every customer becomes satisfied: 2+0+9+1+5+4+3 = 24.

Input: customers = [0,12,0,6,1,0,8,2]-List[int], grumpy = [1,1,0,1,0,1,1,0]-List[int], minutes = 1-int
Output: 15-int
Explanation: Without the technique, satisfied customers come from non-grumpy minutes (grumpy=0): minute 2 gives 0, minute 4 gives 1, and minute 7 gives 2, totaling 3. With minutes = 1, we can “fix” exactly one grumpy minute, and the best is minute 1 with 12 customers, for a maximum of 3 + 12 = 15.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.