Grumpy Bookstore Owner
Try to solve the Grumpy Bookstore Owner problem.
We'll cover the following...
We'll cover the following...
Statement
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