Given a positive number, find square root of it. If the number is not a perfect square, then return floor of its square root.
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.
Write an efficient algorithm to find the longest common prefix (LCP) between given set of strings.
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.
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.
In this post, we will discuss division of two numbers (integer or decimal) using Binary Search Algorithm.
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.
In this post, we will see how to sort an array of integers using iterative merge sort algorithm.
Given a sorted array containing duplicates, efficiently find frequency of each element in it without traversing the whole array.
Given an array of integers, find minimum and maximum element present in it by doing minimum comparisons by using divide and conquer technique.
Implement Quick sort algorithm using Hoare’s Partitioning scheme.
Implement Quicksort efficiently for inputs containing many repeated elements.