Maximum number of Unique integers in Sub-Array of given size
Given an array of N integers and a number M. The task is to find out the maximum number of unique integers among all possible… Read More »
Tag Archives: sliding-window
Print Minimum of all Subarrays using set in C++ STL
Given an array of size N and an integer K, find the minimum for each and every contiguous subarray of size K. Examples: Input :… Read More »
Sub-strings of length K containing same character
Given a string ‘str’ and an integer ‘k’, the task is to count the number of sub-strings of length ‘k’ which are comprised of the… Read More »
Subarray of size k with given sum
Given an array arr[], an integer K and a Sum. The task is to check if there exists any subarray with K elements whose sum… Read More »
Majority element in a circular array of 0’s and 1’s
Given a circular array containing only 0’s and 1’s, of size n where n = p*q (p and q are both odd integers). The task… Read More »
Lexicographically smallest and largest substring of size k
Given a String str and an integer k, find the lexicographically smallest and largest substring of length k Lexicography order, also called as alphabetical order… Read More »
Count Occurences of Anagrams
Given a word and a text, return the count of the occurences of anagrams of the word in the text(For eg: anagrams of word for… Read More »
Subarray whose absolute sum is closest to K
Given an array of n elements and an integer K, the task is to find the subarray with minimum value of ||a[i] + a[i +… Read More »
Number of subarrays having sum in a given range
Given an array arr[] of positive integers and a range (L, R). Find number of subarrays having sum in the range L to R. Examples:… Read More »
Find Index of 0 to be replaced with 1 to get longest continuous sequence of 1s in a binary array | Set-2
Given an array of 0s and 1s, find the position of 0 to be replaced with 1 to get longest continuous sequence of 1s. Expected… Read More »
N-bonacci Numbers
You are given two Integers N and M, and print all the terms of the series upto M-terms of the N-bonacci Numbers. For example, when… Read More »
Subarray with no pair sum divisible by K
Given an array of N non-negative integers, task is to find the maximum size of a subarray such that the pairwise sum of the elements… Read More »
Number of subarrays having sum less than K
Given an array of numbers and a number k, find the number of subarrays having sum less than k. We may assume that there is… Read More »
Number of subarrays with given product
Given an array of positive numbers and a number k, find the number of subarrays having product exactly equal to k. We may assume that… Read More »
Minimum Swaps required to group all 1’s together
Given an array of 0’s and 1’s, we need to write a program to find the minimum number of swaps required to group all 1’s… Read More »