Skip to content

Tag Archives: subarray

Given an array arr[] consisting of N integers, the task is to split the array into subarrays such that the sum of the difference between… Read More
Given an array arr[] consisting of N integers, the task is to find the length of the smallest subarray required to be removed to make… Read More
Given an array arr[] consisting of N integers and two positive integers M and K, the task is to check if there exists any subarray… Read More
Given an array arr[] of size N and an integer M, the task is to count the number of subarrays having product of its elements… Read More
Given an array arr[] consisting of N distinct positive integers and an integer K, the task is to find the minimum MEX from all subarrays… Read More
Given an array arr[] consisting of N positive integers, the task is to count the number of subarrays whose Bitwise OR of its elements even.… Read More
Given a binary array arr[] of size N and a positive integer K, the task is to find the minimum number of times any subarray… Read More
Given an array arr[] consisting of N integers, the task is to replace minimum number of pairs of adjacent elements by their sum to make… Read More
Given an array arr[] of size N, the task is to count the number of subarrays from the given array whose Bitwise XOR  is even.… Read More
Given an array arr[] consisting of N integers and a positive integer K, the task is to count the number of subarrays having exactly K… Read More
Given an array arr[] consisting of N integers and an integer K, the task is to find a subarray of size K with maximum sum… Read More
Given an array arr[] consisting of N integers, the task is to partition the array into two non-empty subarrays such that every element present in… Read More
Given an array arr[] consisting of N positive integers, the task is to count the number of subarrays with product of its elements equal to… Read More
Given an array arr[] consisting of N positive integers, the task is to count the number of subarrays consisting only of pronic numbers. Examples: Input:… Read More
Given an array, arr[] of size N and a positive integer M, the task is to find the maximum subarray product modulo M and the… Read More