Grumpy Bookstore Owner Problem

Grumpy Bookstore Owner Problem — ExecCode Easy DSA Practice

Solve the Grumpy Bookstore Owner problem on ExecCode. Free online easy DSA practice in Sliding Window. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given an integer array customers of length n where customers[i] is the number of the customers that enter the store at the start of the i^th minute and all those customers leave after the end of that minute. Your task is to compute the required answer and return the maximum number of customers that can be satisfied throughout the day. There is a bookstore owner that has a store open for n minutes. During certain minutes, the bookstore owner is grumpy. You are given a binary array grumpy where grumpy[i] is 1 if the bookstore owner is grumpy during the i^th minute, and is 0 otherwise. When the bookstore owner is grumpy, the customers entering during that minute are not satisfied.

Examples

Input {"customers": [1, 0, 1, 2, 1, 1, 7, 5], "grumpy": [0, 1, 0, 1, 0, 1, 0, 1], "minutes": 3}; Output 16

Constraints

n == customers.length == grumpy.length 1 <= minutes <= n <= 2 * 10^4 0 <= customers[i] <= 1000 grumpy[i] is either 0 or 1.

Practice Grumpy Bookstore Owner free on ExecCode. Browse DSA problems, topic map, and placement guides.