I think that it's not a hard problem.

Alternate C++ Solution - keep track of zeros

Not sure if my solution is O(N) or O(N^2) with the inner while loop. I thought f...

from collections import Counter class Solution: def longestOnes(self, nums: L...

For the previous problem, we kept track of the *maximum* count of a single lette...

I got a similar solution to Max's. The only difference is that I kept counters f...

keep track of the count of 0s

Is there a specific reason why we didn't decrement max_repeat_letter_count in th...

I keep going through these sliding window problems and can't really seem to spot...

Shouldn't we need to use a while loop to see if the window has become invalid ra...

It's more intuitive for me to keep track of the count of 0s instead. The conditi...

maxOnesCount does not keep track of the maximum number of repeating 1s in the cu...