# Tag Archives: Binary Search

Given an array arr[] consisting of N integers, the task is to find the maximum count of integers that are binary searchable in the given… Read More
Given a sorted array arr[] and a positive integer D, the task is to find the minimum and the maximum number of array elements that… Read More
Given an integer N denoting the numbers of cards in a specific deck and an array arr[] of size N where ith element denotes the… Read More
Given an array arr[] of N positive integers and a range [L, R], the task is to find the maximum subset-sum such that the difference… Read More
Given a sorted array arr[] consisting of N integers, the task is to find the maximum among the count of positive or negative integers in… Read More
Given an array arr[] of N integers and a positive integer K, the task is to check if it is possible to divide the array… Read More
Given two integers N and B, the task is to print the maximum index a pointer, starting from 0th index can reach in an array… Read More
Given an array arr[] of N integers representing the position of N points along a straight line and an integer K, the task is to… Read More
Given an array arr[] and two positive integers K and C, the task is to maximize the Kth maximum element obtained after splitting an array… Read More
Given an array of N integers the task is to select K elements out of these N elements in such a way that the minimum… Read More
Given an array arr of N integers, the task is to calculate the length of longest sequence of consecutive integers that can be formed from… Read More
Given an array arr[] consisting of N positive integers and a positive integer M, the task is to find the smallest possible integer K such… Read More
Given an array of pairs arr[][] of the form {X, Y} such that each arr[i] represents the time X at which the candidate with candidate… Read More
Given an array arr[] consisting of heights of N chocolate bars, the task is to find the maximum height at which the horizontal cut is… Read More
Given a Generic Tree consisting of N nodes numbered from 0 to N – 1 which is rooted at node 0 and an array val[]… Read More