DIY: Max Consecutive Ones III
Solve the interview question "Max Consecutive Ones III" in this lesson.
We'll cover the following...
Problem statement
Given a binary array, nums
, and an integer, k
, return the maximum number of consecutive 1
s in the array if you can flip at most k
0
s. ...