- What is Binary Search?
- Binary Search - Iterative implementation and common errors
- Binary Search - Recursive Implementation
- Find all pairs with sum K
- Binary Search-finding first or last occurrence of a number
- Find first occurrence of an integer in a sorted list with duplicates
- Binary Search- Count occurrences of a number in a sorted array with duplicates
- Find count of a number in a sorted list with duplicates
- Binary Search- Count occurrences of a number in a sorted array with duplicates
- Binary Search-How many times is a sorted array rotated?
- Binary Search- Search element in a circular sorted array
- What is Binary Search?
- Binary Search - Iterative implementation and common errors
- Binary Search - Recursive Implementation
- Find all pairs with sum K
- Binary Search-finding first or last occurrence of a number
- Find first occurrence of an integer in a sorted list with duplicates
- Binary Search- Count occurrences of a number in a sorted array with duplicates
- Find count of a number in a sorted list with duplicates
- Binary Search- Count occurrences of a number in a sorted array with duplicates
- Binary Search-How many times is a sorted array rotated?
- Binary Search- Search element in a circular sorted array

In this lesson we will be solving a programming interview question to find out the number of rotations of a sorted array in O(log n) time using binary search.