DSA Level 2 Data Structures Hashmap and Heaps Maximum Consecutive Ones - 2

Maximum Consecutive Ones - 2

easy

Hashmap and Heaps

Question Solve Solutions

1. You are given an array(arr) which contains only 0's and 1's and a number K.
2. You have to find the maximum number of consecutive 1's in the given array if you can flip at most K zeroes.

Input Format

A number N arr1 arr2... N numbers A number K

Output Format

A number representing maximum number of consecutive 1's after flipping at most K zeroes.

Constraints

1 <= N <= 10^5
0 <= arr[i] <= 1
1 <= K <= N

Example

Input

6
1 1 0 0 1 1
1

Output

Maximum Consecutive Ones - 1

Longest Substring With At Most K Unique Characters

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String