Skip to content

# Tag Archives: two-pointer-algorithm

Given an array arr[] of size N, the task is to rearrange the array elements such that the count of local minima in the array… Read More
Given two integer arrays arr[] and brr[] consisting of distinct elements of size N and M respectively and an integer K, the task is to… Read More
Given two integer arrays arr[] and brr[] consisting of distinct elements of size N and M respectively and an integer K, the task is to… Read More
Given an array arr[] of length N, the task is to find the length of the longest subarray which consists of consecutive numbers in increasing… Read More
Given an array arr[] of N positive integers with an equal number of even and odd elements. The task is to use in-place swapping to… Read More
There is a one-dimensional garden of length N. In each position of the N length garden, a fountain has been installed. Given an array a[]such… Read More
Given two arrays coins[] and salaries[] where coins[i] represents the value of ith coin and salaries[j] represents the minimum value of the coin that jth… Read More
Given an array arr[] of N positive integers, the task is to find the subarray having maximum sum among all subarrays having unique elements and… Read More
Given an array arr[] of size N, the task is to split the entire array into a minimum number of subarrays such that for each… Read More
Given an array arr[] consisting of N positive integers. The task is to find the length of the longest subarray of this array that contains… Read More
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and… Read More
Given an array arr[] of length N, the task is to find the longest subarray for each array element arr[i], which contains arr[i] as the… Read More
Given an array arr[] consisting of non-negative integers, the task is to find the number of ways to split the array into three non-empty contiguous… Read More
Given an array arr[], the task is to check if it is possible to rearrange the array in such a way that every even index(1-based… Read More
Given a binary string S, the task is to find the minimum number of swaps required to be performed to maximize the value represented by… Read More