# Binary Search

- [Binary Search (Leetcode 704)](/dsa-in-python/binary-search/binary-search-leetcode-704.md)
- [Find First and Last Position of Element in Sorted Array (Leetcode 34)](/dsa-in-python/binary-search/find-first-and-last-position-of-element-in-sorted-array-leetcode-34.md)
- [Number of Occurances](/dsa-in-python/binary-search/number-of-occurances.md)
- [Find Minimum in Rotated Sorted Array (Leetcode 153)](/dsa-in-python/binary-search/find-minimum-in-rotated-sorted-array-leetcode-153.md): The same code is used to find the Rotation Count in Rotated Sorted array
- [Search in Rotated Sorted Array (Leetcode 33)](/dsa-in-python/binary-search/search-in-rotated-sorted-array-leetcode-33.md)
- [Sqrt(x) (Leetcode 69)](/dsa-in-python/binary-search/sqrt-x-leetcode-69.md)
- [Ceil in a Sorted Array \[Search Insert Position\]  (Leetcode 35)](/dsa-in-python/binary-search/ceil-in-a-sorted-array-search-insert-position-leetcode-35.md): Ceil of an element in a sorted array
- [Floor in a Sorted Array](/dsa-in-python/binary-search/floor-in-a-sorted-array.md)
- [Find Smallest Letter Greater Than Target (Leetcode 744)](/dsa-in-python/binary-search/find-smallest-letter-greater-than-target-leetcode-744.md)
- [Binary Search on Infinite Array \[To be completed\]](/dsa-in-python/binary-search/binary-search-on-infinite-array-to-be-completed.md)
- [Find Peak Element (Leetcode 162)](/dsa-in-python/binary-search/find-peak-element-leetcode-162.md)
- [Peak Index in a Mountain Array (Leetcde 852)](/dsa-in-python/binary-search/peak-index-in-a-mountain-array-leetcde-852.md): Same as Leetcode 162 (Find Peak Element)
- [Single Element in a Sorted Array (Leetcode 540)](/dsa-in-python/binary-search/single-element-in-a-sorted-array-leetcode-540.md)
- [\*\*\*Median of Two Sorted Arrays (Leetcode 4)](/dsa-in-python/binary-search/median-of-two-sorted-arrays-leetcode-4.md)
- [Count Negative Numbers in a Sorted Matrix (Leetcode 1351)](/dsa-in-python/binary-search/count-negative-numbers-in-a-sorted-matrix-leetcode-1351.md)
- [\*\*\*Allocate Books](/dsa-in-python/binary-search/allocate-books.md)
- [\*\*\*Painter's Partition Problem](/dsa-in-python/binary-search/painters-partition-problem.md): Similar to Allocate Books
- [\*\*\*Capacity To Ship Packages Within D Days (Leetcode 1011)](/dsa-in-python/binary-search/capacity-to-ship-packages-within-d-days-leetcode-1011.md): Similar to Allocate Books
- [\*\*\*Koko Eating Bananas(Leetcode 875)](/dsa-in-python/binary-search/koko-eating-bananas-leetcode-875.md)
