Practice
Category
26 Questions
| Binary Search Category | Questions |
|---|---|
| Search | Two Sum ll Input Array is Sorted |
| Search a 2D Matrix And ll | |
| H-Index ll | |
| Find Peak Element | |
| >= Left to Right, larger to equal | Count Complete Tree Nodes |
| Minimum Size Subarray Sum | |
| Search Insert Position | |
| First Bad Version | |
| Count of Smaller Number | |
| <= right to left, or Smaller to equal | Sqrt(x) |
| Wood Cut | |
| Range | Search for a range |
| Smallest Rectangle Enclosing Black Pixels | |
| Subarray Sum ll | |
| Sorted Array | Search in Rotated Sorted Array & ll |
| Find Minimum in Rotated Sorted Array & ll | |
| two halves, left or right half | Divide Two Integers |
| Closest Binary Search Tree Value | |
| Median of Two Sorted Arrays | |
| Find the Duplicate Number | |
| Find Peak Element ll | |
| Pow(x,n) | |
| K-th Smallest Element in a BST |
Ref: Victor Tang on Youtube