Longest subsegment of ‘1’s formed by changing at most k ‘0’s | Set 2 (Using Queue)
Last Updated :
07 Feb, 2023
Given a binary array a[] and a number k, we need to find the length of the longest subsegment of ‘1’s possible by changing at most k ‘0’s.
Examples:
Input: a[] = {1, 0, 0, 1, 1, 0, 1}, k = 1
Output: 4
Explanation: Here, we should only change 1 zero(0). Maximum possible length we can get is by changing the 3rd zero in the array, we get a[] = {1, 0, 0, 1, 1, 1, 1}
Input: a[] = {1, 0, 0, 1, 0, 1, 0, 1, 0, 1}, k = 2
Output: 5
Two Pointer Approach: Refer the Set 1 of this article for the implementation of Two-pointer approach.
Queue Approach: The task can be solved with the help of a queue. Store the indices of 0s encountered so far in a queue. For each 0, check if the value of K is greater than 0 or not, if it is non-zero, flip it to 1, and maximize the subsegment length correspondingly, else shift the left pointer (initially at the start index of the string) to the index of first zero (queue's front) + 1.
Follow the below steps to solve the problem:
- Declare a queue for storing Indices of 0s Visited.
- Iterate over the string and If the current character is 0 and some spells are left i.e. (k != 0) then use the spell i.e. (decrement k). Also, store the index of "0" occurred.
- If k = 0, Take out the front of the queue and store it in a variable.
- Store the length as max between i-low and that of the previous answer.
- Shift low to index of first "0" + 1 and increment k.
- Finally, return the answer.
Below is the implementation of the above approach:
C++
// C++ program for the above approach
#include <bits/stdc++.h>
using namespace std;
// Function to Find longest subsegment of 1s
int get(int n, int k, int arr[])
{
// Queue for storing indices of 0s
queue<int> q;
int low = 0;
int ans = INT_MIN;
int p = k;
int i = 0;
while (i < n) {
// If the current character is 1
// then increment i by 1
if (arr[i] == 1) {
i++;
}
// If the current character is 0
// and some spells are
// left then use them
else if (arr[i] == 0 && k != 0) {
q.push(i);
k--;
i++;
}
// If k == 0
else {
// Take out the index where
// the first "0" was found
int x = q.front();
q.pop();
// Store the length as max
// between i-low and that
// of the previous answer
ans = max(ans, i - low);
// Shift low to index
// of first "O" + 1
low = x + 1;
// Increase spell by 1
k++;
}
// Store the length between
// the i-low and that of
// previous answer
ans = max(ans, i - low);
}
return ans;
}
// Driver Code
int main()
{
int N = 10;
int K = 2;
int arr[] = { 1, 0, 0, 1, 0,
1, 0, 1, 0, 1 };
cout << get(N, K, arr) << endl;
return 0;
}
// Java program for the above approach
import java.util.LinkedList;
import java.util.Queue;
class GFG{
// Function to Find longest subsegment of 1s
static int get(int n, int k, int arr[])
{
// Queue for storing indices of 0s
Queue<Integer> q = new LinkedList<Integer>();
int low = 0;
int ans = Integer.MIN_VALUE;
int i = 0;
while (i < n)
{
// If the current character is 1
// then increment i by 1
if (arr[i] == 1)
{
i++;
}
// If the current character is 0
// and some spells are
// left then use them
else if (arr[i] == 0 && k != 0)
{
q.add(i);
k--;
i++;
}
// If k == 0
else
{
// Take out the index where
// the first "0" was found
int x = q.peek();
q.remove();
// Store the length as max
// between i-low and that
// of the previous answer
ans = Math.max(ans, i - low);
// Shift low to index
// of first "O" + 1
low = x + 1;
// Increase spell by 1
k++;
}
// Store the length between
// the i-low and that of
// previous answer
ans = Math.max(ans, i - low);
}
return ans;
}
// Driver Code
public static void main(String args[])
{
int N = 10;
int K = 2;
int arr[] = { 1, 0, 0, 1, 0,
1, 0, 1, 0, 1 };
System.out.println(get(N, K, arr));
}
}
// This code is contributed by gfking
# Python code for the above approach
# Function to Find longest subsegment of 1s
def get(n, k, arr):
# Queue for storing indices of 0s
q = []
low = 0
ans = 10 ** -9
p = k
i = 0
while (i < n):
# If the current character is 1
# then increment i by 1
if (arr[i] == 1):
i += 1
# If the current character is 0
# and some spells are
# left then use them
elif (arr[i] == 0 and k != 0):
q.append(i)
k -= 1
i += 1
# If k == 0
else:
# Take out the index where
# the first "0" was found
x = q[0]
q.pop(0)
# Store the length as max
# between i-low and that
# of the previous answer
ans = max(ans, i - low)
# Shift low to index
# of first "O" + 1
low = x + 1
# Increase spell by 1
k += 1
# Store the length between
# the i-low and that of
# previous answer
ans = max(ans, i - low)
return ans
# Driver Code
N = 10
K = 2
arr = [1, 0, 0, 1, 0, 1, 0, 1, 0, 1]
print(get(N, K, arr))
# This code is contributed by Saurabh Jaiswal
// C# program for the above approach
using System;
using System.Collections.Generic;
class GFG {
// Function to Find longest subsegment of 1s
static int get(int n, int k, int[] arr)
{
// Queue for storing indices of 0s
Queue<int> q = new Queue<int>();
int low = 0;
int ans = Int32.MinValue;
int i = 0;
while (i < n) {
// If the current character is 1
// then increment i by 1
if (arr[i] == 1) {
i++;
}
// If the current character is 0
// and some spells are
// left then use them
else if (arr[i] == 0 && k != 0) {
q.Enqueue(i);
k--;
i++;
}
// If k == 0
else {
// Take out the index where
// the first "0" was found
int x = q.Peek();
q.Dequeue();
// Store the length as max
// between i-low and that
// of the previous answer
ans = Math.Max(ans, i - low);
// Shift low to index
// of first "O" + 1
low = x + 1;
// Increase spell by 1
k++;
}
// Store the length between
// the i-low and that of
// previous answer
ans = Math.Max(ans, i - low);
}
return ans;
}
// Driver Code
public static void Main()
{
int N = 10;
int K = 2;
int[] arr = { 1, 0, 0, 1, 0, 1, 0, 1, 0, 1 };
Console.WriteLine(get(N, K, arr));
}
}
// This code is contributed by ukasp.
<script>
// JavaScript code for the above approach
// Function to Find longest subsegment of 1s
function get(n, k, arr) {
// Queue for storing indices of 0s
let q = [];
let low = 0;
let ans = Number.MIN_VALUE;
let p = k;
let i = 0;
while (i < n) {
// If the current character is 1
// then increment i by 1
if (arr[i] == 1) {
i++;
}
// If the current character is 0
// and some spells are
// left then use them
else if (arr[i] == 0 && k != 0) {
q.push(i);
k--;
i++;
}
// If k == 0
else {
// Take out the index where
// the first "0" was found
let x = q[0];
q.shift();
// Store the length as max
// between i-low and that
// of the previous answer
ans = Math.max(ans, i - low);
// Shift low to index
// of first "O" + 1
low = x + 1;
// Increase spell by 1
k++;
}
// Store the length between
// the i-low and that of
// previous answer
ans = Math.max(ans, i - low);
}
return ans;
}
// Driver Code
let N = 10;
let K = 2;
let arr = [1, 0, 0, 1, 0,
1, 0, 1, 0, 1];
document.write(get(N, K, arr) + '<br>');
// This code is contributed by Potta Lokesh
</script>
Time Complexity: O(N)
Auxiliary Space: O(k)
Related Topic: Subarrays, Subsequences, and Subsets in Array
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
4 min read
Sorting Algorithms A Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read