Count pairs from two arrays having sum equal to K
Given an integer K and two arrays A1 and A2, the task is to return the total number of pairs (one element from A1 and… Read More »
Category Archives: Searching
Check whether (i,j) exists such that arr[i] != arr[j] and arr[arr[i]] is equal to arr[arr[j]]
Given an array A[]. The task is to determine if it is possible to choose two indices ‘i’ and ‘j’ such that the below conditions… Read More »
Count pairs in an array such that frequency of one is at least value of other
Given an array A[] of integers. The task is to find the total number of ordered pairs of positive integers (X, Y) such that X… Read More »
Longest subarray with elements having equal modulo K
Given an integer K and an array arr of integer elements, the task is to print the length of the longest sub-array such that each… Read More »
Count elements such that there are exactly X elements with values greater than or equal to X
Given an array arr of N integers, the task is to find the number of elements that satisfy the following condition: If the element is… Read More »
Search in a sorted 2D matrix (Stored in row major order)
Given an integer ‘K’ and a row-wise sorted 2-D Matrix i.e. the matrix has the following properties: Integers in each row are sorted from left… Read More »
Longest subarray with elements divisible by k
Suppose you a given an array. You have to find the length of the longest subarray such that each and every element of it is… Read More »
Number of segments where all elements are greater than X
Given an array of N integers and a number X, the task is to find the number of segments such that all elements in the… Read More »
Find array elements with frequencies in range [l , r]
Given an array of integers, find the elements from the array whose frequency lies in the range [l, r]. Examples: Input : arr[] = {… Read More »
Find the k smallest numbers after deleting given elements
Given an array of integers, find the k smallest numbers after deleting given elements. In case of repeating elements delete only one instance in the… Read More »
Remove elements that appear strictly less than k times
Given an array of integers, remove all the elements which appear strictly less than k times. Examples: Input : arr[] = {1, 2, 2, 3,… Read More »
Check if a string contains a palindromic sub-string of even length
S is string containing only lowercase English alphabets. We need to find if there exists at least one palindromic sub-string whose length is even. Examples:… Read More »
Remove elements from the array which appear more than k times
Given an array of integers, remove all the occurrences of those elements which appear strictly more than k times in the array. Examples: Input :… Read More »
Find the smallest after deleting given elements
Given an array of integers, find the smallest number after deleting given elements. In case of repeating elements, we delete one instance (from the original… Read More »
Find the largest after deleting the given elements
Given an array of integers, find the largest number after deleting the given elements. In case of repeating elements, delete one instance for every instance… Read More »