## Find bitonic point in given bitonic sequence

You are given a bitonic sequence, the task is to find Bitonic Point in it. A Bitonic Sequence is a sequence of numbers which is… Read More »

- Binary Search a String
- Meta Binary Search | One-Sided Binary Search
- Number of subarrays have bitwise OR >= K
- Distribute N candies among K people
- Search element in a Spirally sorted Matrix
- Minimum in an array which is first decreasing then increasing
- Finding Floor and Ceil of a Sorted Array using C++ STL
- Program to find Nth term divisible by a or b
- Minimum K such that every substring of length atleast K contains a character c
- Search in a sorted 2D matrix (Stored in row major order)
- Find if array has an element whose value is half of array sum
- Find the maximum possible value of the minimum value of modified array
- Minimum number N such that total set bits of all numbers from 1 to N is at-least X
- Count numbers < = N whose difference with the count of primes upto them is > = K
- Number of anomalies in an array
- Count numbers in a range having GCD of powers of prime factors equal to 1
- Floor of every element in same array
- Find element position in given monotonic sequence
- Find minimum speed to finish all Jobs
- Count of Numbers such that difference between the number and sum of its digits not less than L
- Ceiling of every element in same array
- Count elements such that there are exactly X elements with values greater than or equal to X
- Lower Insertion Point

You are given a bitonic sequence, the task is to find Bitonic Point in it. A Bitonic Sequence is a sequence of numbers which is… Read More »

Given hypotenuse and area of a right angle triangle, get its base and height and if any triangle with given hypotenuse and area is not… Read More »

Given a sorted array of n elements containing elements in range from 1 to n-1 i.e. one element occurs twice, the task is to find… Read More »

Given an array of limits. For every limit, find the prime number which can be written as the sum of the most consecutive primes smaller… Read More »

Arrays.binarySearch() is the simplest and most efficient method to find an element in a sorted array in Java Declaration: public static int binarySearch(data_type arr, data_type… Read More »

You are given a number n ( 3 <= n < 10^6 ) and you have to find nearest prime less than n? Examples: Input… Read More »

java.util.Collections.binarySearch() method is a java.util.Collections class method that returns position of an object in a sorted list. // Returns index of key in sorted list… Read More »

Prerequisite: Linear Search Binary Search A linear search scans one item at a time, without jumping to any item . The worst case complexity is O(n),… Read More »

Given a sorted array and a value x, the floor of x is the largest element in array smaller than or equal to x. Write… Read More »

A vertex cover of an undirected graph is a subset of its vertices such that for every edge (u, v) of the graph, either ‘u’… Read More »

Given a number n, find the cube root of n. Examples: Input: n = 3 Output: Cubic Root is 1.442250 Input: n = 8 Output:… Read More »

Given a set of strings, find the longest common prefix. Input : {“geeksforgeeks”, “geeks”, “geek”, “geezer”} Output : “gee” Input : {“apple”, “ape”, “april”} Output… Read More »

I got interviewed by MAQ via Skype and they asked me below three question and the duration was 20 min :- 1. Write a program… Read More »

Binary search is a widely used searching algorithm that requires the array to be sorted before search is applied. The main idea behind this algorithm… Read More »

A rational is represented as p/qb, for example 2/3. Given a sorted array of rational numbers, how to search an element using Binary Search. Use… Read More »