## Find the sums for which an array can be divided into sub-arrays of equal sum

Given an array of integers arr[], the task is to find all the values for sum such that for a value sum[i] the array can… Read More »

- Length of the longest Subarray with only Even Elements
- Check whether an Array is Subarray of another Array
- Generating subarrays using recursion
- Longest Subarray with Sum greater than Equal to Zero
- Sum of minimum elements of all subarrays
- Subarray of size k with given sum
- Find the sums for which an array can be divided into sub-arrays of equal sum
- Number of subarrays with odd sum
- Length of largest sub-array having primes strictly greater than non-primes
- Smallest Integer to be inserted to have equal sums
- Subarray whose absolute sum is closest to K
- Smallest subarray such that all elements are greater than K
- Sort an array where a subarray of a sorted array is in reverse order
- Count subarrays with Prime sum
- Maximize the number of subarrays with XOR as zero
- Maximum sum subarray such that start and end values are same
- 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
- Longest subarray with elements divisible by k
- Number of sub-arrays that have at least one duplicate
- Smallest sum contiguous subarray | Set-2
- Find the count of Strictly decreasing Subarrays
- Largest sub-array whose all elements are perfect squares
- Count Subarrays with Consecutive elements differing by 1
- Longest subarray having difference in the count of 1's and 0's equal to k
- 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 integers arr[], the task is to find all the values for sum such that for a value sum[i] the array can… Read More »

Given an array arr[] of N integers. The task is to count the total number of subarrays of the given array such that difference between… Read More »

Given an array of N positive numbers, the task is to find a contiguous subarray (L-R) such that a[L]=a[R] and sum of a[L] + a[L+1]… Read More »

Given two arrays A[] and B[] consisting of and integers. The task is to check whether the array B[] is a subarray of the array… Read More »

Given an array of integer elements, the task is to find the length of the largest sub-array of such that all the elements of the… Read More »

Given an array A[] of integers. The task is to count the total number of strictly decreasing subarrays( with size > 1 ). Examples: Input… Read More »

Given an array of N integers and a number K, the task is to find the length of the smallest subarray in which all the… Read More »

Given an array A[] of integers. The task is to count total subarrays whose sum is prime with ( size > 1 ). Examples: Input… Read More »

Given an array arr of n elements, the task is to find the number of the sub-arrays of the given array that contain at least… Read More »

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 »