## Maximize the maximum among minimum of K consecutive sub-arrays

Given an integer K and an array arr[], the task is to split the array arr[] into K consecutive subarrays to find the maximum possible… 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
- Find the longest Fibonacci-like subarray of the given array
- 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
- 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
- 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
- Maximum length of the sub-array whose first and last elements are same
- Check if all sub-numbers have distinct Digit product

Given an integer K and an array arr[], the task is to split the array arr[] into K consecutive subarrays to find the maximum possible… Read More »

Given an array of N elements, the task is to find the longest subarray which is Fibonacci-like. A Fibonacci-like sub-array is defined as an array… Read More »

Given an array of N including positive and negative numbers only. The task is to find the length of the longest alternating (means negative-positive-negative or… Read More »

Given an array arr[] of integers. The task is to return the length of the maximum size sub-array such that either one of the condition… Read More »

Given an array arr[] and an integer K, the task is to find whether the array can be divided into two sub-arrays such that the… Read More »

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 »