## Number of subarrays having product less than K

Given an Array of positive numbers, calculate the number of possible subarrays having product greater than a given number K. Examples : Input : arr[]… 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
- Find the sums for which an array can be divided into sub-arrays of equal sum
- Length of the longest alternating subarray
- Check if array can be divided into two sub-arrays such that their absolute difference is K
- Number of subarrays with odd sum
- 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
- Maximum sum subarray such that start and end values are same
- Count subarrays with Prime sum
- Count subarrays with all elements greater than K
- Maximize the number of subarrays with XOR as zero
- Check if subarray with given product exists in an array
- Longest Prime Subarray after removing one element
- 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
- Find the longest Fibonacci-like subarray of the given array
- Check if all sub-numbers have distinct Digit product

Given an Array of positive numbers, calculate the number of possible subarrays having product greater than a given number K. Examples : Input : arr[]… Read More »

Given a array of n numbers. We need to count the number of subarrays having the product and sum of elements are equal Examples: Input… Read More »

Given an array, we need to find two subarrays with a specific length K such that sum of these subarrays is maximum among all possible… Read More »

Given an array of integers greater than zero, find if it is possible to split it in two subarrays (without reordering the elements), such that… Read More »

Given an array of integers, we need to get total XOR of all subarray XORs where subarray XOR can be obtained by XORing all elements… Read More »

You are given an array of positive and/or negative integers and a value K . The task is to find count of all sub-arrays whose… Read More »

Given an array of n positive integers and a positive integer k, the task is to find the maximum subarray size such that all subarrays… Read More »

Given an array, the task is to calculate the sum of lengths of contiguous subarrays having all elements distinct. Examples: Input : arr[] = {1,… Read More »