Skip to content

Tag Archives: subarray

Given an array arr[], consisting of N integers, the task is to find the minimum number of moves required to make all numbers in the… Read More
Given an array A[] of length N, the task is to count the number of subarrays of A[] that contain the length of that subarray.… Read More
Given three integers N, X, Y, and an array arr[] of size N, the task is to find the count of subarrays having at least… Read More
Given an array arr[] of size N, the task is to find the minimum difference between the maximum and the minimum subarray sum when the… Read More
Given an integer array arr of size N[], the task is to find the longest equilibrium subarray i.e. a subarray such that the prefix sum… Read More
Given an array A[] of size N, the task is to find the minimum element present in all subarrays for all sizes from 1 to… Read More
Given a binary array arr[] of size N, and an integer K, the task is to calculate the number of ways to partition the array… Read More
Given an array arr[] of length N, the task is to find the minimum operations to make all the array elements equal where in each… Read More
Given integers N and K, the task is to construct an array arr[] of size N using numbers in the range [1, N] such that… Read More
Given an array arr[]of integers with length N and an integer X, the task is to calculate the number of subarrays with median greater than… Read More
Given an array arr[] of length N and integer K, the task is to print subarray ranges (starting index, ending index) of the array where… Read More
Given an array A[] of size N, the task is to find the minimum number of operations required to make all the elements of the… Read More
Given an array arr[] of length N, the task is to find the largest sum contiguous subarray by adding an integer S exactly at K… Read More
Given two arrays nums[] of size N and target[]. The task is to find the number of non-empty subarrays of nums[] that do not contain… Read More

Start Your Coding Journey Now!