| 4 | Median of Two Sorted Arrays | Hard | binary search |
| 33 | Search in Rotated Sorted Array | Medium | binary search |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | binary search |
| 35 | Search Insert Position | Medium | binary search |
| 69 | Sqrt(x) | Medium | binary search |
| 74 | Search a 2D Matrix | Medium | binary search |
| 81 | Search in Rotated Sorted Array II | Medium | binary search |
| 153 | Find Minimum in Rotated Sorted Array | Medium | binary search |
| 154 | Find Minimum in Rotated Sorted Array II | Hard | binary search |
| 162 | Find Peak Element | Medium | binary search |
| 209 | Minimum Size Subarray Sum | Medium | two pointers |
| 222 | Count Complete Tree Nodes | Medium | binary search |
| 275 | H-Index II | Medium | binary search |
| 278 | First Bad Version | Easy | binary search |
| 287 | Find the Duplicate Number | Hard | two pointers |
| 300 | Longest Increasing Subsequence | Medium | binary search |
| 302 | Smallest Rectangle Enclosing Black Pixels | Hard | binary search |
| 349 | Intersection of Two Arrays | Easy | two pointers |
| 350 | Intersection of Two Arrays II | Easy | two pointers |
| 354 | Russian Doll Envelopes | Hard | binary search |
| 363 | Max Sum of Rectangle No Larger Than K | Hard | binary search |
| 367 | Valid Perfect Square | Medium | binary search |
| 374 | Guess Number Higher or Lower | Easy | binary search |
| 410 | Split Array Largest Sum | Hard | binary search |
| 436 | Find Right Interval | Medium | binary search |
| 441 | Arranging Coins | Easy | math |
| 475 | Heaters | Easy | binary search |
| 540 | Single Element in a Sorted Array | Medium | binary search |
| 658 | Find K Closest Elements | Medium | binary search |
| 668 | Kth Smallest Number in Multiplication Table | Hard | binary search |
| 702 | Search in a Sorted Array of Unknown Size | Medium | binary search |
| 704 | Binary Search | Easy | binary search |
| 710 | Random Pick with Blacklist | Hard | binary search |
| 718 | Maximum Length of Repeated Subarray | Medium | backtracking |
| 719 | Find K-th Smallest Pair Distance | Hard | binary search |
| 744 | Find Smallest Letter Greater Than Target | Easy | binary search |
| 774 | Minimize Max Distance to Gas Station | Hard | binary search |
| 786 | K-th Smallest Prime Fraction | Hard | binary search |
| 793 | Preimage Size of Factorial Zeroes Function | Hard | binary search |
| 852 | Peak Index in a Mountain Array | Easy | binary search |
| 875 | Koko Eating Bananas | Medium | binary search |
| 878 | Nth Magical Number | Hard | binary search |
| 894 | All Possible Full Binary Trees | Medium | binary search |
| 911 | Online Election | Medium | binary search |
| 981 | Time Based Key-Value Store | Medium | binary search |
| 1011 | Capacity To Ship Packages Within D Days | Medium | binary search |
| 1060 | Missing Element in Sorted Array | Medium | binary search |
| 1064 | Fixed Point | Easy | binary search |
| 1095 | Find in Mountain Array | Hard | binary search |
| 1102 | Path With Maximum Minimum Value | Medium | breadth first search |
| 1103 | Distribute Candies to People | Easy | math |
| 1110 | Delete Nodes And Return Forest | Medium | binary search |
| 1150 | Check If a Number Is Majority Element in a Sorted Array | Easy | math |
| 1157 | Online Majority Element In Subarray | Hard | math |
| 1170 | Compare Strings by Frequency of the Smallest Character | Easy | binary search |
| 1201 | Ugly Number III | Medium | binary search |
| 1215 | Stepping Numbers | Medium | breadth first search |
| 1228 | Missing Number In Arithmetic Progression | Easy | binary search |
| 1231 | Divide Chocolate | Hard | binary search |
| 1274 | Number of Ships in a Rectangle | Hard | binary search |
| 1283 | Find the Smallest Divisor Given a Threshold | Medium | binary search |
| 1287 | Element Appearing More Than 25% In Sorted Array | Easy | binary search |
| 1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | Medium | dynamic programming |
| 1300 | Sum of Mutated Array Closest to Target | Medium | math |
| 1385 | Find the Distance Value Between Two Arrays | Easy | binary search |
| 1439 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | Hard | binary heap |
| 1482 | Minimum Number of Days to Make m Bouquets | Medium | binary search |
| 1508 | Range Sum of Sorted Subarray Sums | Medium | two pointers |
| 1533 | Find the Index of the Large Integer | Medium | binary search |
| 1539 | Kth Missing Positive Number | Easy | binary search |
| 1552 | Magnetic Force Between Two Balls | Medium | binary search |
| 1608 | Special Array With X Elements Greater Than or Equal X | Easy | sort |
| 1618 | Maximum Font to Fit a Sentence in a Screen | Medium | binary search |
| 1631 | Path With Minimum Effort | Medium | graph |
| 1648 | Sell Diminishing-Valued Colored Balls | Medium | binary search |
| 1671 | Minimum Number of Removals to Make Mountain Array | Medium | binary search |
| 1713 | Minimum Operations to Make a Subsequence | Hard | binary search |
| 1723 | Find Minimum Time to Finish All Jobs | Hard | backtracking |
| 1751 | Maximum Number of Events That Can Be Attended II | Hard | dynamic programming |
| 1760 | Minimum Limit of Balls in a Bag | Medium | binary search |
| 1802 | Maximum Value at a Given Index in a Bounded Array | Medium | binary search |
| 1818 | Minimum Absolute Sum Difference | Medium | binary search |
| 1847 | Closest Room | Hard | sort |
| 1870 | Minimum Speed to Arrive on Time | Medium | binary search |
| 1889 | Minimum Space Wasted From Packaging | Hard | binary search |
| 1891 | Cutting Ribbons | Medium | binary search |
| 1898 | Maximum Number of Removable Characters | Medium | binary search |
| 1901 | Find a Peak Element II | Medium | binary search |
| 1906 | Minimum Absolute Difference Queries | Medium | array |
| 1918 | Kth Smallest Subarray Sum | Medium | binary search |
| 1923 | Longest Common Subpath | Hard | hash table |
| 1954 | Minimum Garden Perimeter to Collect Enough Apples | Medium | math |
| 1956 | Minimum Time For K Virus Variants to Spread | Hard | geometry |
| 1964 | Find the Longest Valid Obstacle Course at Each Position | Hard | binary search |
| 2040 | Kth Smallest Product of Two Sorted Arrays | Hard | two pointers |
| 2048 | Next Greater Numerically Balanced Number | Medium | string |
| 2064 | Minimized Maximum of Products Distributed to Any Store | Medium | binary search |
| 2070 | Most Beautiful Item for Each Query | Medium | sort |
| 2071 | Maximum Number of Tasks You Can Assign | Hard | greedy |
| 2080 | Range Frequency Queries | Medium | design |
| 2111 | Minimum Operations to Make the Array K-Increasing | Hard | binary search |
| 2137 | Pour Water Between Buckets to Make Water Levels Equal | Medium | binary search |
| 2141 | Maximum Running Time of N Computers | Hard | greedy |
| 2187 | Minimum Time to Complete Trips | Medium | binary search |
| 2226 | Maximum Candies Allocated to K Children | Medium | binary search |
| 2234 | Maximum Total Beauty of the Gardens | Hard | two pointers |
| 2250 | Count Number of Rectangles Containing Each Point | Medium | binary search |
| 2251 | Number of Flowers in Full Bloom | Hard | sort |
| 2271 | Maximum White Tiles Covered by a Carpet | Medium | array |
| 2286 | Booking Concert Tickets in Groups | Hard | design |
| 2300 | Successful Pairs of Spells and Potions | Medium | binary search |
| 2333 | Minimum Sum of Squared Difference | Medium | binary search |
| 2387 | Median of a Row Wise Sorted Matrix | Medium | binary search |
| 2389 | Longest Subsequence With Limited Sum | Easy | binary search |
| 2426 | Number of Pairs Satisfying Inequality | Hard | binary search tree |
| 2448 | Minimum Cost to Make Array Equal | Hard | binary search |
| 2476 | Closest Nodes Queries in a Binary Search Tree | Hard | binary search |
| 2503 | Maximum Number of Points From Grid Queries | Hard | breadth first search |
| 2513 | Minimize the Maximum of Two Arrays | Medium | binary search |
| 2517 | Maximum Tastiness of Candy Basket | Medium | binary search |
| 2528 | Maximize the Minimum Powered City | Hard | binary search |
| 2529 | Maximum Count of Positive Integer and Negative Integer | Easy | binary search |
| 2554 | Maximum Number of Integers to Choose From a Range I | Medium | binary search |
| 2557 | Maximum Number of Integers to Choose From a Range II | Medium | binary search |
| 2560 | House Robber IV | Medium | binary search |
| 2594 | Minimum Time to Repair Cars | Medium | binary search |
| 2601 | Prime Subtraction Operation | Medium | greedy |
| 2602 | Minimum Operations to Make All Array Elements Equal | Medium | binary search |
| 2604 | Minimum Time to Eat All Grains | Hard | greedy |
| 2616 | Minimize the Maximum Difference of Pairs | Medium | binary search |
| 2702 | Minimum Operations to Make Numbers Non-positive | Hard | binary search |
| 2735 | Collecting Chocolates | Medium | stack |
| 2736 | Maximum Sum Queries | Hard | stack |
| 2774 | Array Upper Bound | Easy | design |
| 2790 | Maximum Number of Groups With Increasing Length | Hard | greedy |
| 2812 | Find the Safest Path in a Grid | Medium | breadth first search |
| 2817 | Minimum Absolute Difference Between Elements With Constraint | Medium | binary search tree |
| 2819 | Minimum Relative Loss After Buying Chocolates | Hard | greedy |
| 2861 | Maximum Number of Alloys | Medium | math |
| 2907 | Maximum Profitable Triplets With Increasing Prices I | Medium | binary search tree |
| 2921 | Maximum Profitable Triplets With Increasing Prices II | Hard | binary search tree |
| 2926 | Maximum Balanced Subsequence Sum | Hard | binary search tree |
| 2936 | Number of Equal Numbers Blocks | Medium | binary search |
| 2940 | Find Building Where Alice and Bob Can Meet | Hard | binary search |
| 2941 | Maximum GCD-Sum of a Subarray | Hard | dynamic programming |
| 2945 | Find Maximum Non-decreasing Array Length | Hard | dynamic programming |
| 2968 | Apply Operations to Maximize Frequency Score | Hard | two pointers |
| 3006 | Find Beautiful Indices in the Given Array I | Medium | two pointers |
| 3007 | Maximum Number That Sum of the Prices Is Less Than or Equal to K | Medium | math |
| 3008 | Find Beautiful Indices in the Given Array II | Hard | two pointers |
| 3048 | Earliest Second to Mark Indices I | Medium | binary search |
| 3049 | Earliest Second to Mark Indices II | Hard | binary search |
| 3104 | Find Longest Self-Contained Substring | Hard | binary search |
| 3116 | Kth Smallest Amount With Single Denomination Combination | Hard | binary search |
| 3134 | Find the Median of the Uniqueness Array | Hard | binary search |
| 3135 | Equalize Strings by Adding or Removing Characters at Ends | Medium | binary search |
| 3145 | Find Products of Elements of Big Array | Hard | binary search |
| 3197 | Find the Minimum Area to Cover All Ones II | Hard | dynamic programming |
| 3231 | Minimum Number of Increasing Subsequence to Be Removed | Hard | binary search |
| 3233 | Find the Count of Numbers Which Are Not Special | Medium | binary search |
| 3264 | Final Array State After K Multiplication Operations I | Easy | two pointers |
| 3266 | Final Array State After K Multiplication Operations II | Hard | two pointers |
| 3281 | Maximize Score of Numbers in Ranges | Medium | binary search |
| 3288 | Length of the Longest Increasing Path | Hard | binary search |
| 3296 | Minimum Number of Seconds to Make Mountain Height Zero | Medium | binary search |
| 3312 | Sorted GCD Pair Queries | Hard | math |
| 3344 | Maximum Sized Array | Medium | bit manipulation |
| 3356 | Zero Array Transformation II | Medium | binary search |
| 3357 | Minimize the Maximum Adjacent Element Difference | Hard | binary search |
| 3364 | Minimum Positive Sum Subarray | Easy | two pointers |
| 3398 | Smallest Substring With Identical Characters I | Hard | binary search |
| 3399 | Smallest Substring With Identical Characters II | Hard | binary search |
| 3414 | Maximum Score of Non-overlapping Intervals | Hard | dynamic programming |
| 3419 | Minimize the Maximum Edge Weight of Graph | Medium | graph |
| 3449 | Maximize the Minimum Game Score | Hard | binary search |
| 3453 | Separate Squares I | Medium | geometry |
| 3464 | Maximize the Distance Between Points on a Square | Hard | binary search |
| 3477 | Fruits Into Baskets II | Easy | binary search |
| 3479 | Fruits Into Baskets III | Medium | binary search |
| 3489 | Zero Array Transformation IV | Medium | dynamic programming |
| 3520 | Minimum Threshold for Inversion Pairs Count | Medium | binary search |
| 3574 | Maximize Subarray GCD Score | Hard | dynamic programming |
| 3585 | Find Weighted Median Node in Tree | Hard | tree |
| 3605 | Minimum Stability Factor of Array | Hard | binary search |
| 3620 | Network Recovery Pathways | Hard | graph |
| 3646 | Next Special Palindrome Number | Hard | bit manipulation |
| 3709 | Design Exam Scores Tracker | Medium | design |
| 3710 | Maximum Partition Factor | Hard | graph |
| 3719 | Longest Balanced Subarray I | Medium | array |
| 3721 | Longest Balanced Subarray II | Hard | array |
| 3722 | Lexicographically Smallest String After Reverse | Medium | binary search |
| 3733 | Minimum Time to Complete All Deliveries | Medium | binary search |
| 3735 | Lexicographically Smallest String After Reverse II | Hard | binary search |
| 3762 | Minimum Operations to Equalize Subarrays | Hard | array |
| 3770 | Largest Prime from Consecutive Prime Sum | Medium | math |
| 3771 | Total Score of Dungeon Runs | Medium | binary search |
| 3801 | Minimum Cost to Merge Sorted Lists | Hard | dynamic programming |
| 3807 | Minimum Cost to Repair Edges to Traverse a Graph | Medium | binary search |
| 3814 | Maximum Capacity Within Budget | Medium | array |
| 3824 | Minimum K to Reduce Array Within Limit | Medium | binary search |
| 3825 | Longest Strictly Increasing Subsequence With Non-Zero Bitwise AND | Medium | binary search |
| 3893 | Maximum Team Size with Overlapping Intervals | Medium | binary search |
| 3896 | Count Digit Appearances | Medium | math |
| 3911 | K-th Smallest Remaining Even Integer in Subarray Queries | Hard | binary search |
| 3920 | Maximize Fixed Points After Deletions | Hard | binary search |
| 3924 | Minimum Threshold Path With Limited Heavy Edges | Hard | binary search |
| 3932 | Count K-th Roots in a Range | Medium | binary search |
| 3934 | Smallest Unique Subarray | Hard | binary search |
| 3971 | Maximum Total Value | Hard | binary search |
| 3989 | Maximum Consistent Columns in a Grid | Hard | dynamic programming |