Max Consecutive Ones III

Understanding the Problem This problem uses a "sliding window" strategy. Given an array of binary, what is the longest length of consecutive "1"s we can return given our ability to flip "k" number of "0"s. Consider the following: array = [1, 1, 1, 0]...