1052. Grumpy Bookstore Owner | Sliding Window | Walmart Labs | EPAM Systems

[@mohit7717]

You clear question as I take 2 I miss consecutive minutes ... thanks Aryan

[@shawtylikesfood]

Did you buy the leetcode premium? Or are you using an extension?

[@iankitveer]

What drawing tool is this ?

[@prathamsharma4416]

thanks broo

[@codecraftV]

@Aryan Mittal Bro please answer my question can i say that this questions is similar to maximum sum sub array of length min , since we need maximum customers right? So , we have to maximize the sum , can i do it in that way

[@codebreaker6578]

who else done it by themselves , without being grumpy 😂😂

[@Sanjay-iy5zf]

surprisingly mee

[@IK-xk7ex]

I solved it by myself the same way, probably because there is no another way to solve it :)

[@EngineeringWithBhavesh]

am i only the one who was not able to do it on its own?

[@harshal8781]

aaj company ke shirt dhone dale hai kya 🙃

[@mohit7717]

I try to think the same problem using vector of pair but unable to do ...
```
int maxSatisfied(vector& customers, vector& grumpy, int minutes) {
vectorpr;
for(int i=0;i

[@ankitkumaryadav562]

customers = [10,1,7]
grumpy = [0,0,0]
minutes = 2
Output - 18
Some body please explain me this how the output is 18
It supposed to be "11"

[@developer00007]

Answer is 18 because the store owner is not grumpy throughout the minutes as you can see it's [0,0,0] hence there no need to use the minutes variable which is 2.

[@ankitkumaryadav562]

@@developer00007 Understand, I thought 0 means grumpy

[@abinash1878]

Read the problem properly

[@Sanjay-iy5zf]

Take time to read the problem cleary and become friend with it