# Binary Search

- [4 Median of Two Sorted Arrays](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/4-median-of-two-sorted-arrays.md)
- [29 Divide Two Integers](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/29-divide-two-integers.md)
- [33 Search in Rotated Sorted Array](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/33-search-in-rotated-sorted-array.md)
- [34 Search for a Range](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/34-search-for-a-range.md)
- [35 Search Insert Position](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/35-search-insert-position.md)
- [50 Pow(x, n)](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/50-powx-n.md)
- [69 Sqrt(x)](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/69-sqrtx.md)
- [74 Search a 2D Matrix](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/74-search-a-2d-matrix.md)
- [81 Search in Rotated Sorted Array II](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/81-search-in-rotated-sorted-array-ii.md)
- [153    Find Minimum in Rotated Sorted Array](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/153-find-minimum-in-rotated-sorted-array.md)
- [154    Find Minimum in Rotated Sorted Array II](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/154-find-minimum-in-rotated-sorted-array-ii.md)
- [162    Find Peak Element](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/162-find-peak-element.md)
- [240    Search a 2D Matrix II](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/240-search-a-2d-matrix-ii.md)
- [275    H-Index II](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/275-h-index-ii.md)
- [278    First Bad Version](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/278-first-bad-version.md)
- [287    Find the Duplicate Number](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/287-find-the-duplicate-number.md)
- [302    Smallest Rectangle Enclosing Black Pixels](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/302-smallest-rectangle-enclosing-black-pixels.md)
- [367 Valid Perfect Square](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/367-valid-perfect-square.md)
- [374 Guess Number Higher or Lower](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/374-guess-number-higher-or-lower.md)
- [410    Split Array Largest Sum](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/410-split-array-largest-sum.md)
- [436    Find Right Interval](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/436-find-right-interval.md)
- [441    Arranging Coins](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/441-arrangingcoins.md)
- [475    Heaters](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/475-heaters.md)
- [483    Smallest Good Base](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/483-smallest-good-base.md)
- [540 Single Element in a Sorted Array](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/540-single-element-in-a-sorted-array.md)
- [633 Sum of Square Numbers](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/633-sum-of-square-numbers.md)
- [644    Maximum Average Subarray II](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/644-maximum-average-subarray-ii.md)
- [658    Find K Closest Elements](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/658-find-k-closest-elements.md)
- [719 Find K-th Smallest Pair Distance](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/719-find-k-th-smallest-pair-distance.md)
- [744    Find Smallest Letter Greater Than Target](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/744-find-smallest-letter-greater-than-target.md)
- [774 Minimize Max Distance to Gas Station](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/774-minimize-max-distance-to-gas-station.md)
- [778    Swim in Rising Water](https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search/778-swim-in-rising-water.md)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://protegejj.gitbook.io/algorithm-practice/leetcode/binary-search.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.