Grumpy Bookstore Owner - Leetcode 1052 - Python

[@NeetCodeIO]

sorry about missing the last couple problems. whenever i come back to an easyish question, i feel bad cause people are gonna think im dodging the hard ones end of the month is when it gets tough so lets gooooo 😤😤

[@adilansari-hq9ge]

Hi Navdeep, Thank you for uploading. Please upload easyish questions as well , it is needed to boost confidence and build the foundation.

[@akash-kumar737]

No worries brother. There are others too who help us but your explanation is quite exceptional 😅.

[@fancypants6062]

If you have the time and energy to go back to the bouquet of flowers question, I would really appreciate it. Your channel is great, thank you for what you are doing here :)

[@shahzodshafizod]

Hi bro. Thanks for the best Leetcode content on KZbin. First of all you're the only Indian who speaks without accent, I'd like to here your Indian accent too. Secondly your absence for some period of days is a good experience for those who are dependent of your videos and don't even try to solve problems by themselves.

[@sauravsingh4497]

Can you help us in the previous two binary search questions?

[@TheWhiteFlame574]

we needed you yesterday and the day before

[@GeetainSaar]

😘

[@GeetainSaar]

Okay

[@MykolaPavluchynskyi]

One optimization can be - to do the logic about recalculating max window inside if grumpy[r] - because we only need to recalculate if we find next grumpy == 1. So lines 12-16 - can be in if section. Instead of if we have to use while, but we will do less max comparisons for sure, because we will have amount of max comparisons equals to amount of grumpy days, instead of length of the array.

[@laceycodetime]

This leetcode question would be a good plot for an anime

[@bhuvan9956]

"We are bigger than everybody else" lol

[@DebopriyoBasu]

You post videos at the time I solve daily leetcode problems :) If I get stuck, it's a lot of help. Thanks and keep posting!

[@harshithd9539]

we needed you for yesterday and day before yesterday problem sir

[@nonefvnfvnjnjnjevjenjvonej3384]

indians and chinese love leetcode. why is that?

[@chien-yuyeh9386]

So nice to see ur video again!

[@benedictaamoah5310]

First! Thank you very much Sir for all your help.

[@pat777b]

This is what I came up with. class Solution: def maxSatisfied(self, customers: List[int], grumpy: List[int], minutes: int) -> int: left = 0 right = minutes - 1 candidate = 0 for i in range(len(customers)): candidate += customers[i]*abs(grumpy[i] - 1) for i in range(left, right+1): candidate += customers[i]*grumpy[i] ans = candidate while right < len(customers) - 1: candidate += customers[right+1]*grumpy[right+1] candidate -= customers[left]*grumpy[left] if candidate > ans: ans = candidate left += 1 right += 1 return ans

[@innovativesmartlearning9610]

can you please upload videos of leetcode weekly and biweekly also

[@pastori2672]

honestly not even reading the description is reasonable they need to hire someone specifically for these problem descriptions

[@Moirai0_0]

Thanks for the video.

[@anshumansinha5874]

Q) 1156. Swap For Longest Repeated Character Substring . Can this be related to your earlier solution of 424. Longest Repeating Character Replacement ?

[@xhero9642]

Can you share the solution for 1552. Magnetic Force Between Two Balls

[@mohaimenchowdhury]

I solved it using Prefix sum + 0/1 Knapsack, but runtime was poor 😐

[@prajyot2021]

what if value 5 from ex 1 was at index 1, then a/c to solution left will removed leaving us with not max customers. Can Someone confirm or correct?

[@timonshannikov6452]

Thanks a lot as always)

[@dilmurodabdusamadov5572]

i did prefix sum, worked somehow

[@mohammedsuhail.s192]

bro literally missing you few days .... put videos daily

[@faelzinhh156]

Nice

[@mohanedomer9081]

where were you yester day brother , I needed you 😐😐

[@zorxey3189]

grumpy

[@tanjilurrahmanjim6507]

if grumpy[r] == 1:

[@the-wonderful-day]

1st!

[@anonymouslurker313]

early

[@RajdeepJadeja]

Neetcode went on vacation when I needed him the most🥲