Angry Bookstore Owner - Maximize Customer Satisfaction

maximizeCustomerSatisfaction.js

// Today, the bookstore owner has a store open for customers.length minutes.
// Every minute, some number of customers (customers[i]) enter the store, and all those customers leave after the end of that minute.
// On some minutes, the bookstore owner is grumpy.
// If the bookstore owner is grumpy on the i-th minute, grumpy[i] = 1, otherwise grumpy[i] = 0.
// When the bookstore owner is grumpy, the customers of that minute are not satisfied, otherwise they are satisfied.
// The bookstore owner knows a secret technique to keep themselves not grumpy for X minutes straight, but can only use it once.
// Return the maximum number of customers that can be satisfied throughout the day.

function maximizeCustomerSatisfaction(customers, grumpy, x) {
  const combinations = generateGrumpyCombinations(grumpy, x);
  return combinations.reduce((maximumCustomersSatisfied, combination) => {
    const customersSatisfied = combination.reduce((customersSatisfied, isGrumpy, index) => {
      return isGrumpy ? customersSatisfied : customersSatisfied + customers[index];
    }, 0);
    return customersSatisfied > maximumCustomersSatisfied ? customersSatisfied : maximumCustomersSatisfied;
  }, 0);
}

function generateGrumpyCombinations(grumpy, x) {
  const combinations = [grumpy];
  for (let i = 0; i < grumpy.length - x + 1; i++) {
    combinations.push([...grumpy].fill(0, i, i + x));
  }
  return combinations;
}

console.log(maximizeCustomerSatisfaction([1,0,1,2,1,1,7,5], [0,1,0,1,0,1,0,1], 3) === 16);
console.log(maximizeCustomerSatisfaction([1,1,1,1,1,1,1,1], [1,1,1,1,1,1,1,1], 3) === 3);