Sort the numbers according to their product of digits
Given an array arr[] of N non-negative integers, the task is to sort these integers according to the product of their digits. Examples: Input: arr[]… Read More »
Category Archives: Sorting
Kth number from the set of multiples of numbers A, B and C
Given four integers A, B, C and K. Assume that all the multiples of A, B and C are stored in a set in sorted… Read More »
Minimum increment or decrement operations required to make the array sorted
Given an array arr[] of N integers, the task is to sort the array in non-decreasing order by performing the minimum number of operations. In… Read More »
Minimum steps required to reduce all the elements of the array to zero
Given an array arr[] of positive integers, the task is to find the minimum steps to reduce all the elements to 0. In a single… Read More »
QuickSelect (A Simple Iterative Implementation)
Quickselect is a selection algorithm to find the k-th smallest element in an unordered list. It is related to the quick sort sorting algorithm. Examples:… Read More »
Choose X elements from A[] and Y elements from B[] which satisfy the given condition
Given two arrays A[] and B[] and two integers X and Y, the task is to choose X elements from A[] and Y elements from… Read More »
Count equal element pairs in the given array
Given an array arr[] of N integers representing the lengths of the gloves, the task is to count the maximum possible pairs of gloves from… Read More »
Count of elements which are not at the correct position
Given an array arr[] of N elements and the task is to count the number of elements from this array which are not at the… Read More »
Sort groups of numbers and characters separately in a String
Given a string str of alphanumeric characters, the task is to sort the similar group of consecutive characters separately and print the modified string i.e.… Read More »
Merge two sorted arrays in constant space using Min Heap
Given two sorted arrays, we need to merge them with O(1) extra space into a sorted array, when N is the size of the first… Read More »
Sort elements by modulo with K
Given an array arr[] of integers and an integer K. The task is to sort the elements of the given array in the increasing order… Read More »
Concatenate the strings in an order which maximises the occurrence of subsequence “ab”
Given N strings containing of characters ‘a’ and ‘b’. These string can be concatenated in any order to make a single final string S. The… Read More »
Minimum increment operations to make K elements equal
Given an array arr[] of N elements and an integer K, the task is to make any K elements of the array equal by performing… Read More »
Implementing Counting Sort using map in C++
Counting Sort is one of the best sorting algorithms which can sort in O(n) time complexity but the disadvantage with the counting sort is it’s… Read More »
Sorting Algorithms Visualization | Selection Sort
Pre-requisite: Selection Sort The human brain can easily process visuals in spite of long codes to understand the algorithms. In this article, Selection Sort visualization… Read More »
