k-th missing element in an unsorted array
Given an unsorted sequence a[], the task is to find the K-th missing contiguous element in the increasing sequence of the array elements i.e. consider… Read More »
Category Archives: Sorting
Minimum operations to make frequency of all characters equal K
Given a string S of length N. The task is to find the minimum number of steps required on strings, so that it has exactly… Read More »
Bitwise AND of N binary strings
Given an array arr[] of binary strings, the task is to calculate the bitwise AND of all of these strings and print the resultant string.… Read More »
Convex Hull | Monotone chain algorithm
Given a set of points, the task is to find the covex hull of the given points. The convex hull is the smallest convex polygon… Read More »
Maximum number of segments that can contain the given points
Given an array arr[] containing N integers and two integers X and Y. Consider N line segments, where each line segment has starting and ending… Read More »
Sort the numbers according to their sum of digits
Given an array arr[] of N non-negative integers, the task is to sort these integers according to sum of their digits. Examples: Input: arr[] =… Read More »
Maximum product from array such that frequency sum of all repeating elements in product is less than or equal to 2 * k
Given an array arr[] and an integer k, the task is to find the maximum product from the array such that the frequency sum of… Read More »
Print k different sorted permutations of a given array
Given an array arr[] containing N integers, the task is to print k different permutations of indices such that the values at those indices form… Read More »
Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
Given k sorted arrays of different length, merge them into a single array such that the merged array is also sorted. Examples: Input : {{3,… Read More »
Minimize the sum of the squares of the sum of elements of each group the array is divided into
Given an array consisting of even number of elements, the task is to divide the array into M group of elements (every group must contain… Read More »
Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
Giving k sorted arrays, each of size N, the task is to merge them into a single sorted array. Examples: Input : arr[][] = {{5,… Read More »
Shortest path to traverse all the elements of a circular array in increasing order
There are N distinct integers arranged on a circle. The distance between any two adjacent numbers is 1. The task is to travel on this… Read More »
Make palindromic string non-palindromic by rearranging its letters
Given a string str containing lowercase alphabets (a – z). The task is to print the string after rearranging some characters such that the string… Read More »
Array element with minimum sum of absolute differences
Given an array arr[] of N integers, the task is to find an element x from the array such that |arr[0] – x| + |arr[1]… Read More »
Minimum operations of given type to make all elements of a matrix equal
Given an integer K and a matrix of N rows and M columns, the task is to find the minimum number of operations required to… Read More »