Leetcode 1052. Grumpy Bookstore Owner

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).