Binary Search

Binary Search is a fast divide and conquer-based search algorithm with logarithmic run time complexity. It works on a sorted set of elements.The algorithm works by repeatedly dividing in half the portion of the list that could contain the item until the possible positions are narrowed down to just one. The approach is to start with an interval that covers the complete list of items. If the value of the target element is less than the item in the middle of the interval, narrow down the interval to the left half. Otherwise, narrow down the interval to the upper half. Repeat the process until the interval is narrowed down to just one element.

Aggressive Cows

By Yukti Kumari

● Published At Oct 2021

This article explains the solution to a famous problem, “Aggressive Cows”, ranging from brute force to most optimal.... Keep reading ..

Book Allocation Problem

By Yukti Kumari

● Published At Oct 2021

This article explains how to solve the Book Allocation problem and provides both the brute force and binary search approaches.... Keep reading ..

Binary Search Vs Ternary Search

By Shreya Deep

● Published At Oct 2021

In this article, we’ll learn the difference between binary search and ternary search in terms of their time complexities.... Keep reading ..

Ternary Search

By Reet Maggo

● Published At Oct 2021

This article will explain the Ternary Search technique and its working with the help of a code snippet and algorithm for the given example.... Keep reading ..

Square Root using binary search

By Nishant Rana

● Published At Oct 2021

This blog will cover how we can calculate the Square Root(sqrt) of a given number in Log(n) time using Binary Search.... Keep reading ..

Divide the Chocolate

By Nishant Rana

● Published At Oct 2021

In this blog, we will cover the Divide the Chocolate question and discuss Time and Space complexity.... Keep reading ..

Find the minimum element in a sorted and Rotated Array

By Manvi Chaddha

● Published At Oct 2021

This blog discusses an important interview question: Finding the minimum element in a sorted and rotated array.... Keep reading ..

Minimum coverage by heaters

By Ayush Tiwari

● Published At Jan 2022

This blog finds the minimum heaters range so it can warm all the houses.... Keep reading ..

Plates Between Candles

By GAZAL ARORA

● Published At Nov 2021

In this blog, you will solve a medium-level Leetcode programming question named "Plates Between Candles."
... Keep reading ..

To Find the Nth Number in the Merged and Sorted Lists of Given Ranges.

By Soumya Agrawal

● Published At Mar 2022

This blog will cover the implementation of the problem where we aim to find the Nth number in the merged and sorted lists of given ranges.... Keep reading ..

## Top Problems related to Binary Search

Binary Search

Fourth Largest Element in the Array

Search In Rotated Sorted Array

Occurrence of X in a Sorted Array

Remove Duplicates From String

Time To Burn Tree

Next Greater Element

Search In Infinite Sorted 0-1 Array

Position Of First One

Minimum Subarray With Required Sum

Nth Number

Longest Sub-string with at most K Distinct Characters

Longest Substring Without Repeating Characters

Largest Common Ancestor

Partial BST

Convert Bst To The Greater Sum Tree

Kth Largest Number

First and Last Position of an element in Sorted Array

Search In A Row Wise And Column Wise Sorted Matrix

Algorithm to find best insert position in sorted array

Climbing the leaderboard