HackMD
Binary Search Study Guide
Classic Binary Search
The fundamental binary search algorithm used to efficiently locate a target value within a sorted array.
Practice Problems
Modified Binary Search
Variations of the binary search algorithm adapted for specific problem constraints or data arrangements.
Practice Problems
- 🟨 33. Search in Rotated Sorted Array
- 🟨 153. Find Minimum in Rotated Sorted Array
- 🟨 162. Find Peak Element
Binary Search on Answer
Using binary search to find an optimal answer within a range of possible solutions.
Practice Problems
Binary Search with Boundaries
Problems involving finding the boundaries or specific positions using binary search.
Practice Problems
- 🟨 34. Find First and Last Position of Element in Sorted Array [Solution]
- 🟩 35. Search Insert Position [Solution]
- 🟩 278. First Bad Version
Binary Search in Complex Data Structures
Applying binary search principles to more complex data structures or scenarios.
Practice Problems
Advanced Binary Search Applications
Challenging problems that require sophisticated applications of binary search concepts.
Practice Problems
Problem Difficulty Legend
- 🟩 Easy
- 🟨 Medium
- 🟧 Medium-Hard
- 🟥 Hard
- ⬛ Very Hard
