Algorithms Majority element in sorted array In this article, we will be learning how to find the majority element in a sorted array. This involve using Linear Search, Binary Search and a constant time algorithm.
divide and conquer Find floor in sorted array In this article, we are going to see various methods of finding the floor of a given number from a given sorted array. To solve this efficiently, the concept of Divide and Conquer / Binary Search is required.
Dynamic Programming (DP) Longest Increasing Subsequence [3 techniques] In this article, we have explained the problem of Longest Increasing Subsequence along with 3 techniques (Brute force, Binary Search, Dynamic Programming).
Algorithms K-th smallest element of two sorted arrays In this article, we have explored algorithms to find the K-th smallest element of two sorted arrays. This involve the idea of Binary Search.
List of Mathematical Algorithms N-th root of a number In this article, we have explained three different algorithms to find the N-th root of a number.
Algorithms Find Cube root using Binary Search In this article, we have explained the algorithm to Find Cube root using Binary Search along with Time and Space Complexity analysis.
Algorithms Search an element in Sorted 2D matrix In this article, we will learn about how we can search for a particular element in a sorted 2D matrix.
Algorithms Find Square Root of Number using Binary Search In this article, we have discussed how to find square root of a number using binary search.
Algorithms 4 Array Sum equal to Zero (4Sum II) In this article, we have explored insightful approaches / algorithms to find elements in 4 arrays whose sum is equal to zero. This is an extension of 4 SUM PROBLEM.
Algorithms 2 Sum Closest: Find 2 elements with sum closest to target We have explained how to solve the 2 Sum Closest problem that is Find 2 elements with sum closest to a target efficiently. We have explained 3 different approaches which involves the use of Binary Search and Two Pointer technique.
Algorithms Median of two sorted arrays In this article, we have presented 3 Algorithms to find the Median of two sorted arrays efficiently in logarithmic time. This involves a clever use of Binary Search algorithm.
Algorithms Two Sum Problem In this article, we have explained different approaches to solve the Two Sum Problem using techniques like Binary Search, Hash Map and others.
Algorithms Intersection of two arrays We have explored several approaches to find Intersection of two arrays efficiently. This involve techniques like sorting, binary search, hash map and much more.
Algorithms K-th Smallest element in a row and column wise sorted matrix We have discussed how can we find the kth smallest element in a given n x n matrix, in which every row and column is sorted in non-decreasing order and covered 3 approaches: brute force, using min-heap and using Binary Search.
Algorithms Fractional Cascading in Binary search Fractional Cascading is an optimization over Binary Search to perform Binary Search on K sorted lists to improve the time complexity from O(K logN) to O(logN + K). In this article, fractional cascading in binary search will be covered.
Algorithms Binary Search in a Linked List You are given a sorted singly linked list and a key (element to be searched), find the key in the linked list using binary search algorithm. The challenge is to find the middle element as Linked List does not support random access.
Algorithms Distributing Candies equally In this problem, we need to candies from N boxes each of which has different number of candies across K friends. This problem can be solved using Binary Search.
linked list Search an element in a Linked List How to search a node? Why is searching in Linked List slower than arrays? Is binary search possible in Linked List? Implementations Complexity Reading time: 15 minutes | Coding time: 20 minutes Linked List
Search Algorithms Binary Search Algorithm Binary Search algorithm is an efficient comparison based search algorithm where the key idea is to reduce size of search space by half in every iteration by exploiting a restriction on the search space that it is in sorted order. When suitable, binary search is choose over other search algorithms