Skip to content

Category Archives: Sorting

QuickSort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the pivot. There are many… Read More
You are given X[] of length 2*N, Where N will always be odd, the task is to construct an array Y[] of length N from… Read More
We have two standard sorting algorithms, named bucket sort and radix sort. They both share differences and similarities. Let’s explore some similarities, differences, advantages, and… Read More
Given an array arr[] of size N and a non-negative integer K, the task is to find the length of the longest subsequence such that… Read More
There is only one room which is holding N meetings that are given as intervals of the form (start[i], end[i], people[i]) where start[i] is the… Read More
Given an array stream of n integers in the form of a stream, the task is to find the minimum number of operations that are… Read More
What are sorting networks in parallel computing? Sorting networks are comparison networks that always sort their inputs. They are also known as comparison networks. Comparison… Read More
Given two arrays A[] and B[] of size N and M respectively denoting the required elements of each group and the number of elements in… Read More
Given an input arr[] of length N, Which contains integers from 1 to N in unsorted order. You can apply only one type of operation… Read More
Given an array of positive integer arr[] of length N and an integer Z, (Z > arr[i] for all 0 ≤ i ≤ N –… Read More
Given a sorted array arr[] of size N and integer K, the task is to split the array into K non-empty subarrays such that the… Read More
Given an array Arr of length N, it is reduced by 1 element at each step. Maximum and Minimum elements will be removed in alternating… Read More
Given an array arr[] of N integers and an integer K, where K denotes the maximum number of operations which can be applied to the… Read More
Given a 2D array arr of size N which represents an interval [start, end] inclusive where (start < end), the task is to add only… Read More
Given an array of strings arr[] of length N, the task is to sort the strings in Lexicographical order. Examples: Input: arr[] = {“batman”, “bat”,… Read More

Start Your Coding Journey Now!