Given a binary array nums and an integer k, return the length of the longest contiguous run of 1s achievable if you may flip at most k zeros.
Input
kOutput: the maximum length.
1 1 1 0 0 0 1 1 1 1 0 2
6
Flip the last two 0s in the window [0,0,1,1,1,1].
0 0 1 1 0 0 1 1 1 0 1 1 0 0 0 1 1 1 1 3
10
Run your code against the sample tests, or Submit to run the full suite.