## Smallest multiple of N formed using the given set of digits

Given a set of digits S and an integer N, the task is to find the smallest positive integer if exists which contains only the… Read More »

## Kth largest node among all directly connected nodes to the given node in an undirected graph

Given two arrays u and v, representing a graph such that there is an undirected edge from u[i] to v[i] (0 ≤ v[i], u[i] <… Read More »

## Count number of subsets whose median is also present in the same subset

Given an array arr[] of size N, the task is to count the number of ways we can select a subset from the given array… Read More »

## Largest even number that can be formed by any number of swaps

Given an integer N in the form of string, the task is to find the largest even number from the given number when you are… Read More »

## Find all the pairs with given sum in a BST | Set 2

Given a Binary Search Tree and an integer sum, the task is to find all the pairs from the tree whose sum is equal to… Read More »

## Reorder the position of the words in alphabetical order

Given an array arr[] of strings, the task is to reorder the strings lexicographically and print their positions in the original list. Examples: Input: arr[]… Read More »

## Minimum time required to transport all the boxes from source to the destination under the given constraints

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 »

## Find the maximum cost of an array of pairs choosing at most K pairs

Given an array of pairs arr[], the task is to find the maximum cost choosing at most K pairs. The cost of an array of… Read More »

## Minimum number greater than the maximum of array which cannot be formed using the numbers in the array

Given an array arr[] of integers, the task is to find the minimum number greater than the maximum element from the array which cannot be… Read More »

## Find the minimum number of rectangles left after inserting one into another

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 »

## Largest number not greater than N which can become prime after rearranging its digits

Given a number N, the task is to find the largest number less than or equal to the given number N such that on rearranging… Read More »

## Product of all Subsequences of size K except the minimum and maximum Elements

Given an array A[] containing N elements and an integer K. The task is to calculate the product of all elements of subsequences of size… Read More »

## Sum of elements in 1st array such that number of elements less than or equal to them in 2nd array is maximum

Given two unsorted arrays arr1[] and arr2[], the task is to find the sum of elements of arr1[] such that number of elements less than… Read More »

## Print 2-D co-ordinate points in ascending order followed by their frequencies

Given two arrays x[] and y[] where x[i] represents the x coordinate and y[i] represents the corresponding y coordinate of a 2-D point, the task… Read More »

## Delete odd and even numbers at alternate step such that sum of remaining elements is minimized

Given an array arr[] of N elements. At any step, we can delete a number of a different parity from the just previous step, i.e.,… Read More »