## Find the maximum sequence of continuous 1’s that can be formed by replacing at-most k zeroes by ones

Given an Boolean array, find the maximum sequence of continuous 1’s that can be formed by replacing at-most k zeroes by ones.

Coding made easy

Given an Boolean array, find the maximum sequence of continuous 1’s that can be formed by replacing at-most k zeroes by ones.

Given an array of integers, find all distinct combinations of given length where repetition of elements is allowed.

Given an array of integers, find all distinct combinations of given length.

Given an circular array of integers, find subarray in it which has the largest sum.

Given an array of integers, find contiguous subarray within it which has the largest sum.

Given an array of integers, find the maximum difference between two elements in the array such that smaller element appears before the larger element.

The longest bitonic subarray problem is to find a subarray of a given sequence in which the subarray’s elements are first sorted in in increasing order, then in decreasing order, and the subarray is as long as possible.

Given an array of integers, find largest sub-array formed by consecutive integers. The sub-array should contain all distinct values.

Given a limited range array of size n where array contains elements between 1 to n-1 with one element repeating, find the duplicate number in it.

Given an array of integers, replace each element of the array with product of every other element in the array without using division operator.

Given an array of integers, find maximum product of two integers in an array.

Given a binary array, find the index of 0 to be replaced with 1 to get maximum length sequence of continuous ones.