## Maximum sum subarray of size range [L, R]

Given an integer array arr[] of size N and two integer L and R. The task is to find the maximum sum subarray of size… Read More »

- Product of all Subarrays of an Array
- Count of subarrays having exactly K perfect square numbers
- Minimum number of operations to convert array A to array B by adding an integer into a subarray
- Count of subarrays which start and end with the same element
- Maximum GCD of all subarrays of length at least 2
- Longest Mountain Subarray
- Check if sum of any subarray is Palindrome or not
- Maximum length of Strictly Increasing Sub-array after removing at most one element
- Longest common subarray in the given two arrays
- Sum of all subarrays of size K
- Length of longest Subarray with equal number of odd and even elements
- Minimum size Subarray with maximum sum in non-increasing order
- Longest subarray such that difference of max and min is at-most K
- Count of possible subarrays and subsequences using given length of Array
- Shortest subarray to be removed to make all Array elements unique
- Longest subarray whose elements can be made equal by maximum K increments
- Minimum possible sum of array elements after performing the given operation
- Longest subarray in which absolute difference between any two element is not greater than X
- Length of Longest Subarray with same elements in atmost K increments
- Maximum XOR value of maximum and second maximum element among all possible subarrays
- Find subarray of Length K with Maximum Peak
- Product of all non repeating Subarrays of an Array
- Minimum and Maximum of all subarrays of size K using Map
- Check if a subarray exists with sum greater than the given Array
- Count of subarrays of size K with elements having even frequencies
- Count of subarrays having exactly K prime numbers
- Range Queries for number of Armstrong numbers in an array with updates
- Count of subarrays of size K which is a permutation of numbers from 1 to K
- Length of largest subarray whose all elements are Perfect Number
- Maximum sum subarray having sum less than or equal to given sum using Set

Given an integer array arr[] of size N and two integer L and R. The task is to find the maximum sum subarray of size… Read More »

Given an array arr[] consisting of N integers, the task is to find the start and end indices of the first subarray with a Negative… Read More »

Given an array arr[] of positive integers. The task is to reverse a subarray to minimize the sum of elements at even places and print… Read More »

Given an array arr[] of N elements. The task is to find the length of the longest subarray such that the product of the subarray… Read More »

Given an array arr[] of N integers, the task is to find the size of largest subarray with frequency of all elements same. Examples: Input:… Read More »

Given an arr[] consisting of N elements, the task is to count all subarrays of size K having atleast one pair whose absolute difference is… Read More »

Given an array arr[], we need to find the maximum sum of the even indexed elements that can be obtained by performing right shift operation… Read More »

Given an integer N, the task is to make an array of unique elements of length N such that all subarrays sum modulo N equals… Read More »

Given three integer N, K and X, the task is to create an array of length N suach that sum of all its K-length subarrays… Read More »

Given a string str of lowercase alphabets, the task is to remove minimum characters from the given string so that string can be break into… Read More »

Given an array arr[] and an integer K, the task is to find the minimum number of operations required to change an array B of… Read More »

Given an array arr[] of size N, the task is to find the number of times the array can be partitioned repetitively into two subarrays… Read More »

Given an array arr[] and two integers N and K, the task is to choose non-overlapping N subarrays of size K such that maximum element… Read More »

Given a number N and an integer S, the task is to create an array of N integers such that sum of all elements equals… Read More »

Given an array arr[] of integers of size N, the task is to find the products of all subarrays of the array. Examples: Input: arr[]… Read More »