## Count the triplets such that A[i] < B[j] < C[k]

Given three array A[], B[] and C[] of N integers each. The task is to find the count of triplets (A[i], B[j], C[k]) such that… Read More »

- Check if it is possible to reach a number by making jumps of two given length
- Smallest Pair Sum in an array
- Ternary Search
- Count common characters in two strings
- Nagarro Interview Experience Off-campus
- Number of subarrays have bitwise OR >= K
- Check if array can be sorted with one swap
- Remove exactly one element from the array such that max - min is minimum
- Maximum element in a sorted and rotated array
- Search element in a Spirally sorted Matrix
- Count Triplets such that one of the numbers can be written as sum of the other two
- Find a distinct pair (x, y) in given range such that x divides y
- Repeated Character Whose First Appearance is Leftmost
- Minimum in an array which is first decreasing then increasing
- Minimize the maximum minimum difference after one removal from array
- Count of strings that become equal to one of the two strings after one removal
- Find the minimum number of rectangles left after inserting one into another
- Pairs with same Manhattan and Euclidean distance
- Partition the array into three equal sum segments
- Given an array and two integers l and r, find the kth largest element in the range [l, r]
- Occurrences of a pattern in binary representation of a number
- Remove all occurrences of any element for maximum array sum
- Find missing element in a sorted array of consecutive numbers
- Two equal sum segment range queries
- Leftmost and rightmost indices of the maximum and the minimum element of an array
- Divide array into two parts with equal sum according to the given constraints
- Find the number of elements greater than k in a sorted array
- Persistent Trie | Set 1 (Introduction)
- Integers from the range that are composed of a single distinct digit
- Count the number of operations required to reduce the given number

Given three array A[], B[] and C[] of N integers each. The task is to find the count of triplets (A[i], B[j], C[k]) such that… Read More »

Given an integer array of size n and a number k. If the indexing is 1 based then the middle element of the array is… Read More »

Given a string, find the repeated character present first in the string. Examples: Input : geeksforgeeks Output : g (mind that it will be g,… Read More »

Given a 2d-matrix mat[][] consisting of positive integers, the task is to find the minimum number of steps required to reach the end of the… Read More »

Given an integer array arr[] of length N consisting of positive integers, the task is to minimize the number of steps required to reach the… Read More »

Prerequisite: Trie Persistency in Data Structure Trie is one handy data structure that often comes into play when performing multiple string lookups. In this post,… Read More »

Given two strings A and B and two integers b and m. The task is to find that if it is possible to form string… Read More »

Given two arrays box[] and truck[] where box[i] represents the weight of the ith box and truck[i] represents the maximum load that the ith truck… Read More »

Given N intervals in the form [l, r] and an integer Q. The task is to find the interval which when removed results in the… Read More »

Given an array arr[] of integers, where the ith integer represents the position where an island is present, and an integer k (1 ≤ k… Read More »

Given an array of positive integers, remove all the occurrences of element to get the maximum sum of the remaining array Examples: Input : arr… Read More »

Given width and height of N rectangles. The task is to find the minimum number of rectangles left after inserting one into another. Note :… Read More »

Given N non-overlapping ranges L[] and R[] where the every range starts after the previous range ends i.e. L[i] > R[i – 1] for all… Read More »

Given a string str, its sub-strings are formed in such a way that all the sub-strings starting with the first character of the string will… Read More »

Given four integers a, b, c and k. The task is to find the minimum positive value of x such that ax2 + bx +… Read More »