Sort a Doubly Linked List using Merge Sort
Given a doubly linked list, sort it using merge sort algorithm.
Find square root of a number using binary search algorithm
Given a positive number, find square root of it. If the number is not a perfect square, then return floor of its square root.
Unbounded Binary Search
Given a monotonically increasing function f(x), find the value of x where f(x) becomes positive for the first time. In other words, find a positive integer x such that f(x-1), f(x-2),… are negative and f(x+1), f(x+2),… are positive.
Find the longest common prefix (LCP) between given set of strings
Write an efficient algorithm to find the longest common prefix (LCP) between given set of strings.
Find the odd occurring element in log(n) time
Given an array of integers where every element appears even number of times except one element which appears odd number of times, find that odd occurring element in O(log(n)) time and constant space.
Find Missing Term in a Sequence in log(n) time
Given a sequence of numbers such that the difference between the consecutive terms is constant, find missing term in it in O(log(n)) time.
Division of Two Numbers using Binary Search Algorithm
In this post, we will discuss division of two numbers (integer or decimal) using Binary Search Algorithm.
Find Floor and Ceil of a number in a sorted array (Recursive solution)
Given a sorted array of integers, find floor and ceil of a given number in it. The floor and ceiling map the given number to the largest previous or the smallest following integer, respectively.
Iterative Merge Sort Algorithm (Bottom-up Merge Sort)
In this post, we will see how to sort an array of integers using iterative merge sort algorithm.
Find Frequency of each element in a sorted array containing duplicates
Given a sorted array containing duplicates, efficiently find frequency of each element in it without traversing the whole array.
Find Minimum and Maximum element in an array by doing minimum comparisons
Given an array of integers, find minimum and maximum element present in it by doing minimum comparisons by using divide and conquer technique.
Quick sort algorithm using Hoare’s Partitioning scheme
Implement Quick sort algorithm using Hoare’s Partitioning scheme.