medium10 pts · first answer countsarrayssliding-window
Longest run of ones with k flips
You may flip at most k = 2 zeroes to ones. What is the longest run of ones you can get in [1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0]?
Discussion 0
Join free to post in the discussion.
Related questions
- Cost of reading arr[i]Backend Developer
- Inserting at the front of an arrayBackend Developer
- Why push is amortized O(1)Backend Developer
- Changing one character of a stringBackend Developer
- Reversing a simple stringBackend Developer
- slice vs spliceBackend Developer
- Index of the last elementBackend Developer
- indexOf and NaNBackend Developer