## Count subarrays with all elements greater than K

Given an array of N integers and a number K, the task is to find the number of subarrays such that all elements are greater… Read More »

- Check whether an Array is Subarray of another Array
- Length of the longest Subarray with only Even Elements
- Generating subarrays using recursion
- Sum of minimum elements of all subarrays
- Longest Subarray with Sum greater than Equal to Zero
- Subarray of size k with given sum
- Length of the longest alternating subarray
- Find the sums for which an array can be divided into sub-arrays of equal sum
- Check if array can be divided into two sub-arrays such that their absolute difference is K
- Length of largest sub-array having primes strictly greater than non-primes
- Subarray whose absolute sum is closest to K
- Smallest Integer to be inserted to have equal sums
- Smallest subarray such that all elements are greater than K
- Count subarrays with Prime sum
- Maximum sum subarray such that start and end values are same
- Maximize the number of subarrays with XOR as zero
- Count subarrays with all elements greater than K
- Check if subarray with given product exists in an array
- Longest Prime Subarray after removing one element
- Find the longest Fibonacci-like subarray of the given array
- Number of sub-arrays that have at least one duplicate
- Longest subarray with elements divisible by k
- Count Subarrays with Consecutive elements differing by 1
- Largest sub-array whose all elements are perfect squares
- Longest subarray having difference in the count of 1's and 0's equal to k
- Find the count of Strictly decreasing Subarrays
- Maximum size of sub-array that satisfies the given condition
- Maximize the maximum among minimum of K consecutive sub-arrays
- Check if all sub-numbers have distinct Digit product
- Maximum number of contiguous array elements with same number of set bits

Given an array of N integers and a number K, the task is to find the number of subarrays such that all elements are greater… Read More »

Given an array with n elements. The task is to find the maximum number of contiguous array elements which have the same number of set… Read More »

Suppose you a given an array. You have to find the length of the longest subarray such that each and every element of it is… Read More »

Given an array A of n integers. The task is to find the sum of minimum of all possible (contiguous) subarray of A. Examples: Input:… Read More »

Given a number N, the task is to check if the all sub-numbers of this number have distinct digit product. Note: An N digit number… Read More »

Given an array of N numbers. The task is to maximize the number of subarrays with XOR value zero by swapping the bits of array… Read More »

Given an array of positive integers, find the smallest non-negative integer (i.e. greater than or equal to zero) that can be placed between any two… Read More »

Given an array arr[]. The task is to find the length of the longest subarray of arr[] such that it contains only even elements. Examples:… Read More »

Given an array ‘arr’ of length ‘n’. The task is to find the largest contiguous sub-array having the count of prime numbers strictly greater than… Read More »

Given an array A of integers. We can remove at most one index from the array. Our goal is to maximize the length of the… Read More »

Given an array of N integers. The task is to find the maximum length subarray such that the sum of all its elements is greater… Read More »

Given a binary array arr[] of size n and a value k. The task is to find the length of the longest subarray having difference… Read More »

Given an array, generate all the possible subarrays of the given array using recursion. Examples: Input : [1, 2, 3] Output : [1], [1, 2],… Read More »

Given an array of both positive and negative integers and a number K. The task is to check if any subarray with product K is… Read More »

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 »