| 4 | Median of Two Sorted Arrays | — | Hard | ArrayBinary SearchDivide and Conquer | 44% | |
| 33 | Search in Rotated Sorted Array | — | Medium | ArrayBinary Search | 43% | |
| 34 | Find First and Last Position of Element in Sorted Array | — | Medium | ArrayBinary Search | 47% | |
| 35 | Search Insert Position | — | Easy | ArrayBinary Search | 49% | |
| 69 | Sqrt(x) | — | Easy | MathBinary Search | 40% | |
| 74 | Search a 2D Matrix | — | Medium | ArrayBinary SearchMatrix | 52% | |
| 81 | Search in Rotated Sorted Array II | — | Medium | ArrayBinary Search | 39% | |
| 153 | Find Minimum in Rotated Sorted Array | — | Medium | ArrayBinary Search | 52% | |
| 154 | Find Minimum in Rotated Sorted Array II | — | Hard | ArrayBinary Search | 44% | |
| 162 | Find Peak Element | — | Medium | ArrayBinary Search | 46% | |
| 167 | Two Sum II - Input Array Is Sorted | — | Medium | ArrayTwo PointersBinary Search | 63% | |
| 209 | Minimum Size Subarray Sum | — | Medium | ArrayBinary SearchSliding Window | 49% | |
| 222 | Count Complete Tree Nodes | — | Easy | Binary SearchBit ManipulationTree | 70% | |
| 240 | Search a 2D Matrix II | — | Medium | ArrayBinary SearchDivide and Conquer | 55% | |
| 268 | Missing Number | — | Easy | ArrayHash TableMath | 70% | |
| 275 | H-Index II | — | Medium | ArrayBinary Search | 39% | |
| 278 | First Bad Version | — | Easy | Binary SearchInteractive | 46% | |
| 287 | Find the Duplicate Number | — | Medium | ArrayTwo PointersBinary Search | 63% | |
| 300 | Longest Increasing Subsequence | — | Medium | ArrayBinary SearchDynamic Programming | 58% | |
| 315 | Count of Smaller Numbers After Self | — | Hard | ArrayBinary SearchDivide and Conquer | 43% | |
| 327 | Count of Range Sum | — | Hard | ArrayBinary SearchDivide and Conquer | 37% | |
| 349 | Intersection of Two Arrays | — | Easy | ArrayHash TableTwo Pointers | 76% | |
| 350 | Intersection of Two Arrays II | — | Easy | ArrayHash TableTwo Pointers | 59% | |
| 352 | Data Stream as Disjoint Intervalsread | — | Hard | Binary SearchDesignOrdered Set | 59% | |
| 354 | Russian Doll Envelopes | — | Hard | ArrayBinary SearchDynamic Programming | 37% | |
| 363 | Max Sum of Rectangle No Larger Than Kread | — | Hard | ArrayBinary SearchMatrix | 45% | |
| 367 | Valid Perfect Square | — | Easy | MathBinary Search | 44% | |
| 374 | Guess Number Higher or Lower | — | Easy | Binary SearchInteractive | 56% | |
| 378 | Kth Smallest Element in a Sorted Matrix | — | Medium | ArrayBinary SearchSorting | 63% | |
| 400 | Nth Digit | — | Medium | MathBinary Search | 36% | |
| 410 | Split Array Largest Sum | — | Hard | ArrayBinary SearchDynamic Programming | 58% | |
| 436 | Find Right Interval | — | Medium | ArrayBinary SearchSorting | 54% | |
| 441 | Arranging Coins | — | Easy | MathBinary Search | 47% | |
| 456 | 132 Pattern | — | Medium | ArrayBinary SearchStack | 34% | |
| 475 | Heaters | — | Medium | ArrayTwo PointersBinary Search | 40% | |
| 483 | Smallest Good Base | — | Hard | MathBinary Search | 43% | |
| 493 | Reverse Pairs | — | Hard | ArrayBinary SearchDivide and Conquer | 32% | |
| 497 | Random Point in Non-overlapping Rectanglesread | — | Medium | ArrayMathBinary Search | 38% | |
| 528 | Random Pick with Weightread | — | Medium | ArrayMathBinary Search | 48% | |
| 532 | K-diff Pairs in an Array | — | Medium | ArrayHash TableTwo Pointers | 45% | |
| 540 | Single Element in a Sorted Array | — | Medium | ArrayBinary Search | 59% | |
| 611 | Valid Triangle Number | — | Medium | ArrayTwo PointersBinary Search | 52% | |
| 633 | Sum of Square Numbers | — | Medium | MathTwo PointersBinary Search | 36% | |
| 658 | Find K Closest Elements | — | Medium | ArrayTwo PointersBinary Search | 49% | |
| 668 | Kth Smallest Number in Multiplication Table | — | Hard | MathBinary Search | 53% | |
| 704 | Binary Search | — | Easy | ArrayBinary Search | 59% | |
| 710 | Random Pick with Blacklistread | — | Hard | ArrayHash TableMath | 34% | |
| 713 | Subarray Product Less Than K | — | Medium | ArrayBinary SearchSliding Window | 53% | |
| 718 | Maximum Length of Repeated Subarray | — | Medium | ArrayBinary SearchDynamic Programming | 51% | |
| 719 | Find K-th Smallest Pair Distance | — | Hard | ArrayTwo PointersBinary Search | 46% | |