1052. Grumpy Bookstore Owner | Leetcode Daily Challenge (POTD) 21 June 2024 | Sliding Window | O(n) 

best explanation,...Jay Shree Krishan🙏

Nice

One of the Best explanation loved the way you have approached and solved !!! Thanks

easy explanation

i got it by this way: my intuition was get the sum of all grumpy == 0 condition after that i ran a window on all positions and add the sum of grumpy==1 to sum and store max for all windows

Same topic around your topic I do all questions with own but I do not show my skill on RU-vid like you

Explain complexity and write fast,but explanation is good