please suggest changes in this code .
q-Given an array of size n with 0s and 1s , flip at most k 0s to get the longest possible subarray of 1s.
please suggest changes in this code .
q-Given an array of size n with 0s and 1s , flip at most k 0s to get the longest possible subarray of 1s.