GeeksforGeeks

Last Updated: 17 October 2024

Given a sorted array arr[] and a number target, the task is to find the lower bound of the target in this given array. The lower bound of a number is defined as the smalle...read more

Arrays

Binary Search

Searching

DSA

Implement Upper Bound

Last Updated: 17 October 2024

Given a sorted array arr[] and a number target, the task is to find the upper bound of the target in this given array. The upper bound of a number is defined as the smalle...read more

Search in matrix where only individual columns are sorted

Last Updated: 15 April 2025

Given an n * m semi-sorted 2D matrix, mat[][] where each column is individually sorted in ascending order but the rows are not sorted, and a target element x. The task is ...read more

Search in row wise sorted matrix

Last Updated: 19 December 2024

Given a row-wise sorted matrixmat[][]and an integerx, the task is to check ifxis present inmat[][]or not. Note that there is no ordering among column elements.Examples:Inp...read more

CSES Solutions - Multiplication Table

Last Updated: 25 June 2024

Find the middle element when the numbers in an n × n multiplication table are sorted in increasing order. It is assumed that n is odd.For example, the 3 × 3 multiplication...read more

Minimize the Maximum Value in Two Arrays

Last Updated: 08 July 2024

Given two empty arrays arr1[] and arr2[]. You need to add positive integers to these arrays such that they satisfy the following conditions:arr1 contains k1 distinct posit...read more

Find Maximum Number of Removal Queries That Can Be Processed I

Last Updated: 29 April 2024

Given an array called arr[] and another array queries[]. You can perform an operation on arr at most once, replacing it with a subsequence of itself. Then, you process the...read more

Arrays

Amazon

Binary Search

Algorithms-Dynamic Programming

Picked

DSA

bsearch() Function in C

Last Updated: 15 April 2024

In C programming language, bsearch()function is used to perform a binary search on a sorted array to search for an element. The namebsearchstands for “binary search” which...read more

Is there any search faster than Binary Search?

Last Updated: 18 March 2024

No, there is no search faster than Binary Search. Binary Search is the fastest searching algorithm for sorted data. It takes O(log2N) time to search any element in the sor...read more

Binary Search

Searching

DSA

Data Structures and Algorithms-QnA

How to do binary search step by step?

Last Updated: 04 March 2024

Binary search is an efficient search algorithm that works on sorted arrays or lists. It repeatedly divides the search space in half until the target element is found or th...read more

Data Structures and Algorithms-QnA

Why is it called Binary Search?

Last Updated: 04 March 2024

The term "Binary" in binary search refers to the use of a binary decision, which means a decision between two options. This term originated from the Binary Search algorith...read more

Data Structures and Algorithms-QnA

CSES Solutions - Factory Machines

Last Updated: 14 October 2024

A factory has N machines which can be used to make products. Your goal is to make a total of T products.For each machine, you know the number of seconds it needs to make a...read more

Binary Search

Searching

Competitive Programming

Picked

DSA

CSES Problems

CSES Solutions - Array Division

Last Updated: 01 April 2024

You are given an array arr[] containing N positive integers. Your task is to divide the array into K subarrays so that the maximum sum in a subarray is as small as possibl...read more

Binary Search

Searching

Competitive Programming

Picked

DSA

CSES Problems

In what situation can we use binary search?

Last Updated: 19 February 2024

Binary search is a powerful algorithm that can be used to find a target value within a sorted array. It works by repeatedly dividing the array in half until the target val...read more

Binary Search

Searching

DSA

Data Structures and Algorithms-QnA

Minimum number of strictly decreasing subsequences

Last Updated: 05 March 2024

Given an array arr[] of size N. The task is to split the array into minimum number of strictly decreasing subsequences. Calculate the minimum number of subsequences we can...read more