Memoizing your learning progress...
Memoizing your learning progress...
Divide and conquer to find elements or boundaries in sorted data
Given a sorted array of distinct integers and a target value, return the index of the target if it exists, otherwise return -1.
Given a sorted array of distinct integers and a target value, return the index where the target would be inserted to keep the array sorted.
A sorted array of distinct integers was rotated at some unknown pivot. Find the minimum element.
Given an array of integers, find any peak element. A peak element is strictly greater than its neighbors.
Given a non-negative integer n, compute the integer square root of n.
Master the fundamental pattern. Each problem teaches you when and how to apply this technique.