Find the minimum and maximum element in an array using Divide and Conquer
Given an integer array, find the minimum and maximum element present in it by making minimum comparisons by using the divide-and-conquer technique.
Category: Array
Sort an array in one swap whose two elements are swapped
Given an array where all its elements are sorted except two swapped elements, sort it in linear time. Assume there are no duplicates in the array.
Quicksort algorithm using Hoare’s partitioning scheme
Implement the Quicksort algorithm using Hoare’s Partitioning scheme which is more efficient than Lomuto’s partition scheme because it does three times fewer swaps on average, and it creates efficient partitions even when all values are equal.
Count Sort – C++, Java, and Python Implementation
This post covers a variation of counting sort that can work on negative numbers and can sort numbers in any range.
Find a triplet with the given sum in an array
Given an unsorted integer array, find a triplet with a given sum in it.
Find surpasser count for each array element
Given an integer array having distinct elements, find the surpasser count for each element in it. In other words, for each array element, find the total number of elements to its right, which are greater than it.
Merge `M` sorted lists of variable length
Given M sorted lists of variable length, print them efficiently in sorted order.
Introsort Algorithm – Overview and C++ Implementation
Introsort is an efficient in-place sorting algorithm, which usually beats all other sorting algorithms in terms of performance. Due to its high performance, it is used in several standard library sort functions.
Find a triplet having the maximum product in an array
Given an integer array, find a triplet having the maximum product.
Find two numbers with maximum sum formed by array digits
Given an integer array between 0 and 9, find two numbers with maximum sum formed using all the array digits. The difference in the number of digits of the two numbers should be ± 1.
Find the count of distinct elements in every subarray of size `k`
Given an array and an integer k, find the count of distinct elements in every subarray of size k.
Print all subarrays of an array having distinct elements
Given an integer array, print all maximum size subarrays having all distinct elements in them.