1052. Grumpy Bookstore Owner | Sliding Window | Walmart Labs | EPAM Systems
HTML-код
- Опубликовано: 30 сен 2024
- In this video, I'll talk about how to solve Leetcode 1052. Grumpy Bookstore Owner | Sliding Window | Walmart Labs | EPAM Systems
Let's Connect:
📱Discord (Join Community) : / discord
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / codewitharyanbhai
💻 Twitter - / aryan_mittal007
🤖 Github: github.com/ary...
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms
am i only the one who was not able to do it on its own?
who else done it by themselves , without being grumpy 😂😂
surprisingly mee
I solved it by myself the same way, probably because there is no another way to solve it :)
aaj company ke shirt dhone dale hai kya 🙃
What drawing tool is this ?
Did you buy the leetcode premium? Or are you using an extension?
@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
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
You clear question as I take 2 I miss consecutive minutes ... thanks Aryan
thanks broo
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"
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.
@@developer00007 Understand, I thought 0 means grumpy
Read the problem properly
Take time to read the problem cleary and become friend with it