Hard Problems on Subarray:
Length of smallest subarray to be removed to make sum of remaining elements divisible by K
Maximum length of same indexed subarrays from two given arrays satisfying the given condition
Count ways to split array into two equal sum subarrays by changing sign of any one array element
Longest subarray in which all elements are smaller than K
Maximize product of a strictly increasing or decreasing subarray
Sum of maximum of all subarrays by adding even frequent maximum twice
Longest subarray of an array which is a subsequence in another array
Count of subarrays having product as a perfect cube
Minimize difference between maximum and minimum array elements by removing a K-length subarray
Maximum sum submatrix
Minimum removal of elements from end of an array required to obtain sum K
Check if any subarray of length M repeats at least K times consecutively or not
Minimize flips on K-length subarrays required to make all array elements equal to 1
Split array into K subarrays such that sum of maximum of all subarrays is maximized
Find minimum subarray sum for each index i in subarray [i, N-1]
Longest subarray with GCD greater than 1
Longest subsegment of ‘1’s formed by changing at most k ‘0’s
Lexicographically smallest Permutation of Array by reversing at most one Subarray
Find a subsequence which upon reversing gives the maximum sum subarray
Minimize steps to make Array elements 0 by reducing same A[i] – X from Subarray...