Search for a command to run...
Articles tagged with #binary-search-algorithm
I Lower Bound Problem You are given an array 'arr' sorted in non-decreasing order and a number 'x'. You must return the index of lower bound of 'x'. (link) Note: For a sorted array 'arr', 'lower_bound' of a number 'x' is defined as the smallest index...
Problem Statement Koko loves to eat bananas. There are n piles of bananas, the i<sup>th</sup> pile has piles[i] bananas. The guards have gone and will come back in h hours. Koko can decide her bananas-per-hour eating speed of k. Each hour, she choose...
Problem Statement A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. Y...
