Binary Search Problems
About 3 min
Bài toán tìm kiếm
Problem Number | Title | Solution | Tags | Difficulty |
---|---|---|---|---|
0704 | Binary Search | [[LeetCode 0704]] | Array, Binary Search | Easy |
0374 | Guess Number Higher or Lower | [[LeetCode 0374]] | Binary Search, Interactive | Easy |
0035 | Search Insert Position | [[LeetCode 0035]] | Array, Binary Search | Easy |
0034 | Find First and Last Position of Element in Sorted Array | [[LeetCode 0034]] | Array, Binary Search | Medium |
0167 | Two Sum II - Input array is sorted | [[LeetCode 0167]] | Array, Two Pointers, Binary Search | Medium |
0153 | Find Minimum in Rotated Sorted Array | [[LeetCode XXXX]] | Array, Binary Search | Medium |
0154 | Find Minimum in Rotated Sorted Array II | [[LeetCode XXXX]] | Array, Binary Search | Hard |
0033 | Search in Rotated Sorted Array | [[LeetCode XXXX]] | Array, Binary Search | Medium |
0081 | Search in Rotated Sorted Array II | [[LeetCode XXXX]] | Array, Binary Search | Medium |
0278 | First Bad Version | [[LeetCode XXXX]] | Binary Search, Interactive | Easy |
0162 | Find Peak Element | [[LeetCode XXXX]] | Array, Binary Search | Medium |
0852 | Peak Index in a Mountain Array | [[LeetCode XXXX]] | Array, Binary Search | Easy |
1095 | Find in Mountain Array | [[LeetCode XXXX]] | Array, Binary Search, Interactive | Hard |
0744 | Find Smallest Letter Greater Than Target | [[LeetCode XXXX]] | Array, Binary Search | Easy |
0004 | Median of Two Sorted Arrays | [[LeetCode XXXX]] | Array, Binary Search, Divide and Conquer | Hard |
0074 | Search a 2D Matrix | [[LeetCode XXXX]] | Array, Binary Search, Matrix | Medium |
0240 | Search a 2D Matrix II | [[LeetCode XXXX]] | Array, Binary Search, Divide and Conquer, Matrix | Medium |
Bài toán tìm kiếm theo giả thuyết
Problem Number | Title | Solution | Tags | Difficulty |
---|---|---|---|---|
0069 | Sqrt(x) | [[LeetCode XXXX]] | Math, Binary Search | Easy |
0287 | Find the Duplicate Number | [[LeetCode XXXX]] | Bit Manipulation, Array, Two Pointers, Binary Search | Medium |
0050 | Pow(x, n) | [[LeetCode XXXX]] | Recursion, Math | Medium |
0367 | Valid Perfect Square | [[LeetCode XXXX]] | Math, Binary Search | Easy |
1300 | Sum of Mutated Array Closest to Target | [[LeetCode XXXX]] | Array, Binary Search, Sorting | Medium |
0400 | Nth Digit | [[LeetCode XXXX]] | Math, Binary Search | Medium |
Các bài toán tìm kiếm nhị phân phức tạp
Problem Number | Title | Solution | Tags | Difficulty |
---|---|---|---|---|
0875 | Koko Eating Bananas | [[LeetCode XXXX]] | Array, Binary Search | Medium |
0410 | Split Array Largest Sum | [[LeetCode XXXX]] | Greedy, Array, Binary Search, Dynamic Programming, Prefix Sum | Hard |
0209 | Minimum Size Subarray Sum | [[LeetCode XXXX]] | Array, Binary Search, Prefix Sum, Sliding Window | Medium |
0658 | Find K Closest Elements | [[LeetCode XXXX]] | Array, Two Pointers, Binary Search, Sorting, Sliding Window, Heap (Priority Queue) | Medium |
0270 | Closest Binary Search Tree Value | [[LeetCode XXXX]] | Tree, Depth-First Search, Binary Search Tree, Binary Search, Binary Tree | Easy |
0702 | Search in a Sorted Array of Unknown Size | [[LeetCode XXXX]] | Array, Binary Search, Interactive | Medium |
0349 | Intersection of Two Arrays | [[LeetCode XXXX]] | Array, Hash Table, Two Pointers, Binary Search, Sorting | Easy |
0350 | Intersection of Two Arrays II | [[LeetCode XXXX]] | Array, Hash Table, Two Pointers, Binary Search, Sorting | Easy |
0287 | Find the Duplicate Number | [[LeetCode XXXX]] | Bit Manipulation, Array, Two Pointers, Binary Search | Medium |
0719 | Find K-th Smallest Pair Distance | [[LeetCode XXXX]] | Array, Two Pointers, Binary Search, Sorting | Hard |
0259 | 3Sum Smaller | [[LeetCode XXXX]] | Array, Two Pointers, Binary Search, Sorting | Medium |
1011 | Capacity To Ship Packages Within D Days | [[LeetCode XXXX]] | Array, Binary Search | Medium |
1482 | Minimum Number of Days to Make m Bouquets | [[LeetCode XXXX]] | Array, Binary Search | Medium |