Get started
Start with DSA Fundamentals
Programming Fundamentals
Back to modulesModule 04 · 0/32
Module 04
Binary Search
0/3211912
Learning 1D Array Binary Search0/13
- 1Binary Search to find X in Sorted ArrayEasy
- 2Implement Lower BoundEasy
- 3Implement Upper BoundEasy
- 4Search Insert PositionEasy
- 5Floor and Ceil in Sorted ArrayMed.
- 6Find First and Last Occurrence of a Given NumberEasy
- 7Count Occurrences in Sorted ArrayEasy
- 8Search in Rotated Sorted Array IMed.
- 9Search in Rotated Sorted Array IIMed.
- 10Find Minimum in Rotated Sorted ArrayMed.
- 11Find How Many Times Array is RotatedEasy
- 12Single Element in a Sorted ArrayEasy
- 13Find Peak ElementHard
Binary Search on Answers0/14
- 1Find Square Root of a Number in log NMed.
- 2Find the Nth Root of a NumberMed.
- 3Koko Eating BananasHard
- 4Minimum Days to Make M BouquetsHard
- 5Find the Smallest Divisor Given a ThresholdEasy
- 6Capacity to Ship Packages within D DaysHard
- 7Kth Missing Positive NumberEasy
- 8Aggressive CowsHard
- 9Book Allocation ProblemHard
- 10Split Array - Largest SumHard
- 11Painter's PartitionHard
- 12Minimize Max Distance to Gas StationHard
- 13Median of Two Sorted ArraysHard
- 14Kth Element of Two Sorted ArraysMed.