All companies
Amazon
532 Easy1082 Medium374 Hard1988 total
| No. | Problem | Difficulty | Frequency |
|---|---|---|---|
| 1 | Two Sum | Easy | |
| 3 | Longest Substring Without Repeating Characters | Medium | |
| 42 | Trapping Rain Water | Hard | |
| 121 | Best Time to Buy and Sell Stock | Easy | |
| 146 | LRU Cache | Medium | |
| 200 | Number of Islands | Medium | |
| 2 | Add Two Numbers | Medium | |
| 4 | Median of Two Sorted Arrays | Hard | |
| 5 | Longest Palindromic Substring | Medium | |
| 9 | Palindrome Number | Easy | |
| 11 | Container With Most Water | Medium | |
| 14 | Longest Common Prefix | Easy | |
| 15 | 3Sum | Medium | |
| 20 | Valid Parentheses | Easy | |
| 22 | Generate Parentheses | Medium | |
| 23 | Merge k Sorted Lists | Hard | |
| 33 | Search in Rotated Sorted Array | Medium | |
| 49 | Group Anagrams | Medium | |
| 53 | Maximum Subarray | Medium | |
| 56 | Merge Intervals | Medium | |
| 88 | Merge Sorted Array | Easy | |
| 127 | Word Ladder | Hard | |
| 128 | Longest Consecutive Sequence | Medium | |
| 138 | Copy List with Random Pointer | Medium | |
| 207 | Course Schedule | Medium | |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | |
| 347 | Top K Frequent Elements | Medium | |
| 560 | Subarray Sum Equals K | Medium | |
| 767 | Reorganize String | Medium | |
| 875 | Koko Eating Bananas | Medium | |
| 994 | Rotting Oranges | Medium | |
| 6 | Zigzag Conversion | Medium | |
| 7 | Reverse Integer | Medium | |
| 13 | Roman to Integer | Easy | |
| 17 | Letter Combinations of a Phone Number | Medium | |
| 18 | 4Sum | Medium | |
| 21 | Merge Two Sorted Lists | Easy | |
| 25 | Reverse Nodes in k-Group | Hard | |
| 26 | Remove Duplicates from Sorted Array | Easy | |
| 31 | Next Permutation | Medium | |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | |
| 36 | Valid Sudoku | Medium | |
| 41 | First Missing Positive | Hard | |
| 45 | Jump Game II | Medium | |
| 48 | Rotate Image | Medium | |
| 51 | N-Queens | Hard | |
| 54 | Spiral Matrix | Medium | |
| 55 | Jump Game | Medium | |
| 62 | Unique Paths | Medium | |
| 69 | Sqrt(x) | Easy | |
| 70 | Climbing Stairs | Easy | |
| 74 | Search a 2D Matrix | Medium | |
| 75 | Sort Colors | Medium | |
| 76 | Minimum Window Substring | Hard | |
| 78 | Subsets | Medium | |
| 79 | Word Search | Medium | |
| 84 | Largest Rectangle in Histogram | Hard | |
| 118 | Pascal's Triangle | Easy | |
| 122 | Best Time to Buy and Sell Stock II | Medium | |
| 124 | Binary Tree Maximum Path Sum | Hard | |
| 136 | Single Number | Easy | |
| 139 | Word Break | Medium | |
| 155 | Min Stack | Medium | |
| 162 | Find Peak Element | Medium | |
| 169 | Majority Element | Easy | |
| 189 | Rotate Array | Medium | |
| 198 | House Robber | Medium | |
| 199 | Binary Tree Right Side View | Medium | |
| 206 | Reverse Linked List | Easy | |
| 210 | Course Schedule II | Medium | |
| 215 | Kth Largest Element in an Array | Medium | |
| 217 | Contains Duplicate | Easy | |
| 234 | Palindrome Linked List | Easy | |
| 238 | Product of Array Except Self | Medium | |
| 239 | Sliding Window Maximum | Hard | |
| 242 | Valid Anagram | Easy | |
| 253 | Meeting Rooms II | Medium | |
| 283 | Move Zeroes | Easy | |
| 295 | Find Median from Data Stream | Hard | |
| 297 | Serialize and Deserialize Binary Tree | Hard | |
| 322 | Coin Change | Medium | |
| 380 | Insert Delete GetRandom O(1) | Medium | |
| 424 | Longest Repeating Character Replacement | Medium | |
| 460 | LFU Cache | Hard | |
| 540 | Single Element in a Sorted Array | Medium | |
| 621 | Task Scheduler | Medium | |
| 735 | Asteroid Collision | Medium | |
| 739 | Daily Temperatures | Medium | |
| 863 | All Nodes Distance K in Binary Tree | Medium | |
| 904 | Fruit Into Baskets | Medium | |
| 1004 | Max Consecutive Ones III | Medium | |
| 1011 | Capacity To Ship Packages Within D Days | Medium | |
| 1152 | Analyze User Website Visit Pattern | Medium | |
| 1768 | Merge Strings Alternately | Easy | |
| 1757 | Recyclable and Low Fat Products | Easy | |
| 2667 | Create Hello World Function | Easy | |
| 3371 | Identify the Largest Outlier in an Array | Medium | |
| 8 | String to Integer (atoi) | Medium | |
| 10 | Regular Expression Matching | Hard | |
| 12 | Integer to Roman | Medium | |
| 16 | 3Sum Closest | Medium | |
| 19 | Remove Nth Node From End of List | Medium | |
| 27 | Remove Element | Easy | |
| 28 | Find the Index of the First Occurrence in a String | Easy | |
| 32 | Longest Valid Parentheses | Hard | |
| 35 | Search Insert Position | Easy | |
| 37 | Sudoku Solver | Hard | |
| 39 | Combination Sum | Medium | |
| 46 | Permutations | Medium | |
| 50 | Pow(x, n) | Medium | |
| 61 | Rotate List | Medium | |
| 64 | Minimum Path Sum | Medium | |
| 66 | Plus One | Easy | |
| 67 | Add Binary | Easy | |
| 71 | Simplify Path | Medium | |
| 72 | Edit Distance | Medium | |
| 73 | Set Matrix Zeroes | Medium | |
| 80 | Remove Duplicates from Sorted Array II | Medium | |
| 85 | Maximal Rectangle | Hard | |
| 90 | Subsets II | Medium | |
| 92 | Reverse Linked List II | Medium | |
| 98 | Validate Binary Search Tree | Medium | |
| 100 | Same Tree | Easy | |
| 101 | Symmetric Tree | Easy | |
| 102 | Binary Tree Level Order Traversal | Medium | |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | |
| 104 | Maximum Depth of Binary Tree | Easy | |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | |
| 110 | Balanced Binary Tree | Easy | |
| 116 | Populating Next Right Pointers in Each Node | Medium | |
| 125 | Valid Palindrome | Easy | |
| 126 | Word Ladder II | Hard | |
| 130 | Surrounded Regions | Medium | |
| 131 | Palindrome Partitioning | Medium | |
| 134 | Gas Station | Medium | |
| 135 | Candy | Hard | |
| 140 | Word Break II | Hard | |
| 141 | Linked List Cycle | Easy | |
| 142 | Linked List Cycle II | Medium | |
| 143 | Reorder List | Medium | |
| 148 | Sort List | Medium | |
| 150 | Evaluate Reverse Polish Notation | Medium | |
| 151 | Reverse Words in a String | Medium | |
| 152 | Maximum Product Subarray | Medium | |
| 153 | Find Minimum in Rotated Sorted Array | Medium | |
| 160 | Intersection of Two Linked Lists | Easy | |
| 167 | Two Sum II - Input Array Is Sorted | Medium | |
| 175 | Combine Two Tables | Easy | |
| 176 | Second Highest Salary | Medium | |
| 179 | Largest Number | Medium | |
| 181 | Employees Earning More Than Their Managers | Easy | |
| 202 | Happy Number | Easy | |
| 204 | Count Primes | Medium | |
| 205 | Isomorphic Strings | Easy | |
| 209 | Minimum Size Subarray Sum | Medium | |
| 212 | Word Search II | Hard | |
| 219 | Contains Duplicate II | Easy | |
| 224 | Basic Calculator | Hard | |
| 227 | Basic Calculator II | Medium | |
| 230 | Kth Smallest Element in a BST | Medium | |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Medium | |
| 240 | Search a 2D Matrix II | Medium | |
| 268 | Missing Number | Easy | |
| 273 | Integer to English Words | Hard | |
| 287 | Find the Duplicate Number | Medium | |
| 300 | Longest Increasing Subsequence | Medium | |
| 328 | Odd Even Linked List | Medium | |
| 344 | Reverse String | Easy | |
| 349 | Intersection of Two Arrays | Easy | |
| 387 | First Unique Character in a String | Easy | |
| 394 | Decode String | Medium | |
| 399 | Evaluate Division | Medium | |
| 410 | Split Array Largest Sum | Hard | |
| 412 | Fizz Buzz | Easy | |
| 416 | Partition Equal Subset Sum | Medium | |
| 417 | Pacific Atlantic Water Flow | Medium | |
| 438 | Find All Anagrams in a String | Medium | |
| 443 | String Compression | Medium | |
| 472 | Concatenated Words | Hard | |
| 485 | Max Consecutive Ones | Easy | |
| 494 | Target Sum | Medium | |
| 496 | Next Greater Element I | Easy | |
| 503 | Next Greater Element II | Medium | |
| 543 | Diameter of Binary Tree | Easy | |
| 547 | Number of Provinces | Medium | |
| 567 | Permutation in String | Medium | |
| 658 | Find K Closest Elements | Medium | |
| 662 | Maximum Width of Binary Tree | Medium | |
| 692 | Top K Frequent Words | Medium | |
| 733 | Flood Fill | Easy | |
| 704 | Binary Search | Easy | |
| 787 | Cheapest Flights Within K Stops | Medium | |
| 796 | Rotate String | Easy | |
| 852 | Peak Index in a Mountain Array | Medium | |
| 876 | Middle of the Linked List | Easy | |
| 528 | Random Pick with Weight | Medium | |
| 901 | Online Stock Span | Medium | |
| 907 | Sum of Subarray Minimums | Medium | |
| 509 | Fibonacci Number | Easy | |
| 973 | K Closest Points to Origin | Medium | |
| 981 | Time Based Key-Value Store | Medium | |
| 987 | Vertical Order Traversal of a Binary Tree | Hard | |
| 992 | Subarrays with K Different Integers | Hard | |
| 1148 | Article Views I | Easy | |
| 1235 | Maximum Profit in Job Scheduling | Hard | |
| 1268 | Search Suggestions System | Medium | |
| 1492 | The kth Factor of n | Medium | |
| 1650 | Lowest Common Ancestor of a Binary Tree III | Medium | |
| 1752 | Check if Array Is Sorted and Rotated | Easy | |
| 1929 | Concatenation of Array | Easy | |
| 2055 | Plates Between Candles | Medium | |
| 2149 | Rearrange Array Elements by Sign | Medium | |
| 2214 | Minimum Health to Beat Game | Medium | |
| 2357 | Make Array Zero by Subtracting Equal Amounts | Easy | |
| 3434 | Maximum Frequency After Subarray Operation | Medium | |
| 3733 | Minimum Time to Complete All Deliveries | Medium | |
| 24 | Swap Nodes in Pairs | Medium | |
| 29 | Divide Two Integers | Medium | |
| 30 | Substring with Concatenation of All Words | Hard | |
| 38 | Count and Say | Medium | |
| 40 | Combination Sum II | Medium | |
| 44 | Wildcard Matching | Hard | |
| 47 | Permutations II | Medium | |
| 57 | Insert Interval | Medium | |
| 58 | Length of Last Word | Easy | |
| 59 | Spiral Matrix II | Medium | |
| 60 | Permutation Sequence | Hard | |
| 63 | Unique Paths II | Medium | |
| 68 | Text Justification | Hard | |
| 81 | Search in Rotated Sorted Array II | Medium | |
| 83 | Remove Duplicates from Sorted List | Easy | |
| 86 | Partition List | Medium | |
| 89 | Gray Code | Medium | |
| 91 | Decode Ways | Medium | |
| 94 | Binary Tree Inorder Traversal | Easy | |
| 96 | Unique Binary Search Trees | Medium | |
| 97 | Interleaving String | Medium | |
| 99 | Recover Binary Search Tree | Medium | |
| 108 | Convert Sorted Array to Binary Search Tree | Easy | |
| 112 | Path Sum | Easy | |
| 114 | Flatten Binary Tree to Linked List | Medium | |
| 115 | Distinct Subsequences | Hard | |
| 120 | Triangle | Medium | |
| 133 | Clone Graph | Medium | |
| 137 | Single Number II | Medium | |
| 165 | Compare Version Numbers | Medium | |
| 168 | Excel Sheet Column Title | Easy | |
| 173 | Binary Search Tree Iterator | Medium | |
| 174 | Dungeon Game | Hard | |
| 177 | Nth Highest Salary | Medium | |
| 178 | Rank Scores | Medium | |
| 180 | Consecutive Numbers | Medium | |
| 185 | Department Top Three Salaries | Hard | |
| 190 | Reverse Bits | Easy | |
| 197 | Rising Temperature | Easy | |
| 203 | Remove Linked List Elements | Easy | |
| 208 | Implement Trie (Prefix Tree) | Medium | |
| 211 | Design Add and Search Words Data Structure | Medium | |
| 213 | House Robber II | Medium | |
| 221 | Maximal Square | Medium | |
| 225 | Implement Stack using Queues | Easy | |
| 226 | Invert Binary Tree | Easy | |
| 228 | Summary Ranges | Easy | |
| 229 | Majority Element II | Medium | |
| 231 | Power of Two | Easy | |
| 232 | Implement Queue using Stacks | Easy | |
| 237 | Delete Node in a Linked List | Medium | |
| 241 | Different Ways to Add Parentheses | Medium | |
| 258 | Add Digits | Easy | |
| 269 | Alien Dictionary | Hard | |
| 274 | H-Index | Medium | |
| 278 | First Bad Version | Easy | |
| 303 | Range Sum Query - Immutable | Easy | |
| 312 | Burst Balloons | Hard | |
| 316 | Remove Duplicate Letters | Medium | |
| 323 | Number of Connected Components in an Undirected Graph | Medium | |
| 332 | Reconstruct Itinerary | Hard | |
| 334 | Increasing Triplet Subsequence | Medium | |
| 337 | House Robber III | Medium | |
| 345 | Reverse Vowels of a String | Easy | |
| 348 | Design Tic-Tac-Toe | Medium | |
| 354 | Russian Doll Envelopes | Hard | |
| 355 | Design Twitter | Medium | |
| 371 | Sum of Two Integers | Medium | |
| 373 | Find K Pairs with Smallest Sums | Medium | |
| 378 | Kth Smallest Element in a Sorted Matrix | Medium | |
| 383 | Ransom Note | Easy | |
| 392 | Is Subsequence | Easy | |
| 395 | Longest Substring with At Least K Repeating Characters | Medium | |
| 396 | Rotate Function | Medium | |
| 402 | Remove K Digits | Medium | |
| 403 | Frog Jump | Hard | |
| 407 | Trapping Rain Water II | Hard | |
| 414 | Third Maximum Number | Easy | |
| 415 | Add Strings | Easy | |
| 435 | Non-overlapping Intervals | Medium | |
| 437 | Path Sum III | Medium | |
| 448 | Find All Numbers Disappeared in an Array | Easy | |
| 450 | Delete Node in a BST | Medium | |
| 451 | Sort Characters By Frequency | Medium | |
| 455 | Assign Cookies | Easy | |
| 456 | 132 Pattern | Medium | |
| 459 | Repeated Substring Pattern | Easy | |
| 486 | Predict the Winner | Medium | |
| 493 | Reverse Pairs | Hard | |
| 498 | Diagonal Traverse | Medium | |
| 516 | Longest Palindromic Subsequence | Medium | |
| 518 | Coin Change II | Medium | |
| 525 | Contiguous Array | Medium | |
| 1721 | Swapping Nodes in a Linked List | Medium | |
| 542 | 01 Matrix | Medium | |
| 545 | Boundary of Binary Tree | Medium | |
| 556 | Next Greater Element III | Medium | |
| 570 | Managers with at Least 5 Direct Reports | Medium | |
| 577 | Employee Bonus | Easy | |
| 584 | Find Customer Referee | Easy | |
| 588 | Design In-Memory File System | Hard | |
| 595 | Big Countries | Easy | |
| 605 | Can Place Flowers | Easy | |
| 617 | Merge Two Binary Trees | Easy | |
| 632 | Smallest Range Covering Elements from K Lists | Hard | |
| 636 | Exclusive Time of Functions | Medium | |
| 643 | Maximum Average Subarray I | Easy | |
| 645 | Set Mismatch | Easy | |
| 647 | Palindromic Substrings | Medium | |
| 653 | Two Sum IV - Input is a BST | Easy | |
| 661 | Image Smoother | Easy | |
| 678 | Valid Parenthesis String | Medium | |
| 680 | Valid Palindrome II | Easy | |
| 682 | Baseball Game | Easy | |
| 694 | Number of Distinct Islands | Medium | |
| 695 | Max Area of Island | Medium | |
| 696 | Count Binary Substrings | Easy | |
| 713 | Subarray Product Less Than K | Medium | |
| 721 | Accounts Merge | Medium | |
| 724 | Find Pivot Index | Easy | |
| 725 | Split Linked List in Parts | Medium | |
| 746 | Min Cost Climbing Stairs | Easy | |
| 752 | Open the Lock | Medium | |
| 430 | Flatten a Multilevel Doubly Linked List | Medium | |
| 763 | Partition Labels | Medium | |
| 771 | Jewels and Stones | Easy | |
| 703 | Kth Largest Element in a Stream | Easy | |
| 785 | Is Graph Bipartite? | Medium | |
| 790 | Domino and Tromino Tiling | Medium | |
| 791 | Custom Sort String | Medium | |
| 706 | Design HashMap | Easy | |
| 802 | Find Eventual Safe States | Medium | |
| 815 | Bus Routes | Hard | |
| 827 | Making A Large Island | Hard | |
| 622 | Design Circular Queue | Medium | |
| 871 | Minimum Number of Refueling Stops | Hard | |
| 881 | Boats to Save People | Medium | |
| 909 | Snakes and Ladders | Medium | |
| 912 | Sort an Array | Medium | |
| 921 | Minimum Add to Make Parentheses Valid | Medium | |
| 930 | Binary Subarrays With Sum | Medium | |
| 931 | Minimum Falling Path Sum | Medium | |
| 937 | Reorder Data in Log Files | Medium | |
| 962 | Maximum Width Ramp | Medium | |
| 968 | Binary Tree Cameras | Hard | |
| 977 | Squares of a Sorted Array | Easy | |
| 1008 | Construct Binary Search Tree from Preorder Traversal | Medium | |
| 1021 | Remove Outermost Parentheses | Easy | |
| 1038 | Binary Search Tree to Greater Sum Tree | Medium | |
| 1047 | Remove All Adjacent Duplicates In String | Easy | |
| 1045 | Customers Who Bought All Products | Medium | |
| 1071 | Greatest Common Divisor of Strings | Easy | |
| 1068 | Product Sales Analysis I | Easy | |
| 1070 | Product Sales Analysis III | Medium | |
| 1081 | Smallest Subsequence of Distinct Characters | Medium | |
| 1091 | Shortest Path in Binary Matrix | Medium | |
| 1128 | Number of Equivalent Domino Pairs | Easy | |
| 1299 | Replace Elements with Greatest Element on Right Side | Easy | |
| 1143 | Longest Common Subsequence | Medium | |
| 1382 | Balance a Binary Search Tree | Medium | |
| 1174 | Immediate Food Delivery II | Medium | |
| 1192 | Critical Connections in a Network | Hard | |
| 1193 | Monthly Transactions I | Medium | |
| 1207 | Unique Number of Occurrences | Easy | |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | |
| 1429 | First Unique Number | Medium | |
| 1251 | Average Selling Price | Easy | |
| 1283 | Find the Smallest Divisor Given a Threshold | Medium | |
| 1280 | Students and Examinations | Easy | |
| 1344 | Angle Between Hands of a Clock | Medium | |
| 1373 | Maximum Sum BST in Binary Tree | Hard | |
| 1351 | Count Negative Numbers in a Sorted Matrix | Easy | |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | |
| 1378 | Replace Employee ID With The Unique Identifier | Easy | |
| 1431 | Kids With the Greatest Number of Candies | Easy | |
| 1423 | Maximum Points You Can Obtain from Cards | Medium | |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | |
| 1456 | Maximum Number of Vowels in a Substring of Given Length | Medium | |
| 1480 | Running Sum of 1d Array | Easy | |
| 1482 | Minimum Number of Days to Make m Bouquets | Medium | |
| 1496 | Path Crossing | Easy | |
| 1539 | Kth Missing Positive Number | Easy | |
| 1552 | Magnetic Force Between Two Balls | Medium | |
| 1590 | Make Sum Divisible by P | Medium | |
| 1603 | Design Parking System | Easy | |
| 1581 | Customer Who Visited but Did Not Make Any Transactions | Easy | |
| 1642 | Furthest Building You Can Reach | Medium | |
| 1661 | Average Time of Process per Machine | Easy | |
| 1710 | Maximum Units on a Truck | Easy | |
| 1781 | Sum of Beauty of All Substrings | Medium | |
| 1792 | Maximum Average Pass Ratio | Medium | |
| 1838 | Frequency of the Most Frequent Element | Medium | |
| 1863 | Sum of All Subset XOR Totals | Easy | |
| 1922 | Count Good Numbers | Medium | |
| 1934 | Confirmation Rate | Medium | |
| 2104 | Sum of Subarray Ranges | Medium | |
| 2161 | Partition Array According to Given Pivot | Medium | |
| 2221 | Find Triangular Sum of an Array | Medium | |
| 2250 | Count Number of Rectangles Containing Each Point | Medium | |
| 2272 | Substring With Largest Variance | Hard | |
| 2281 | Sum of Total Strength of Wizards | Hard | |
| 2288 | Apply Discount to Prices | Medium | |
| 2235 | Add Two Integers | Easy | |
| 2347 | Best Poker Hand | Easy | |
| 2385 | Amount of Time for Binary Tree to Be Infected | Medium | |
| 2390 | Removing Stars From a String | Medium | |
| 2342 | Max Sum of a Pair With Equal Sum of Digits | Medium | |
| 2355 | Maximum Number of Books You Can Take | Hard | |
| 2434 | Using a Robot to Print the Lexicographically Smallest String | Medium | |
| 2461 | Maximum Sum of Distinct Subarrays With Length K | Medium | |
| 2583 | Kth Largest Sum in a Binary Tree | Medium | |
| 2551 | Put Marbles in Bags | Hard | |
| 2825 | Make String a Subsequence Using Cyclic Increments | Medium | |
| 2877 | Create a DataFrame from List | Easy | |
| 2929 | Distribute Candies Among Children II | Medium | |
| 2965 | Find Missing and Repeated Values | Easy | |
| 2979 | Most Expensive Item That Can Not Be Bought | Medium | |
| 3104 | Find Longest Self-Contained Substring | Hard | |
| 3317 | Find the Number of Possible Ways for an Event | Hard | |
| 1277 | Count Square Submatrices with All Ones | Medium | |
| 2163 | Minimum Difference in Sums After Removal of Elements | Hard | |
| 3413 | Maximum Coins From K Consecutive Bags | Medium | |
| 2790 | Maximum Number of Groups With Increasing Length | Hard | |
| 3459 | Length of Longest V-Shaped Diagonal Segment | Hard | |
| 3610 | Minimum Number of Primes to Sum to Target | Medium | |
| 3612 | Process String with Special Operations I | Medium | |
| 3644 | Maximum K to Sort a Permutation | Medium | |
| 3676 | Count Bowl Subarrays | Medium | |
| 1648 | Sell Diminishing-Valued Colored Balls | Medium | |
| 3752 | Lexicographically Smallest Negated Permutation that Sums to Target | Medium | |
| 3872 | Longest Arithmetic Sequence After Changing At Most One Element | Medium | |
| 3914 | Minimum Operations to Make Array Non Decreasing | Medium | |
| 43 | Multiply Strings | Medium | |
| 52 | N-Queens II | Hard | |
| 65 | Valid Number | Hard | |
| 77 | Combinations | Medium | |
| 82 | Remove Duplicates from Sorted List II | Medium | |
| 87 | Scramble String | Hard | |
| 93 | Restore IP Addresses | Medium | |
| 95 | Unique Binary Search Trees II | Medium | |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | |
| 109 | Convert Sorted List to Binary Search Tree | Medium | |
| 111 | Minimum Depth of Binary Tree | Easy | |
| 113 | Path Sum II | Medium | |
| 119 | Pascal's Triangle II | Easy | |
| 123 | Best Time to Buy and Sell Stock III | Hard | |
| 129 | Sum Root to Leaf Numbers | Medium | |
| 132 | Palindrome Partitioning II | Hard | |
| 144 | Binary Tree Preorder Traversal | Easy | |
| 145 | Binary Tree Postorder Traversal | Easy | |
| 149 | Max Points on a Line | Hard | |
| 171 | Excel Sheet Column Number | Easy | |
| 172 | Factorial Trailing Zeroes | Medium | |
| 182 | Duplicate Emails | Easy | |
| 183 | Customers Who Never Order | Easy | |
| 184 | Department Highest Salary | Medium | |
| 186 | Reverse Words in a String II | Medium | |
| 187 | Repeated DNA Sequences | Medium | |
| 188 | Best Time to Buy and Sell Stock IV | Hard | |
| 191 | Number of 1 Bits | Easy | |
| 196 | Delete Duplicate Emails | Easy | |
| 214 | Shortest Palindrome | Hard | |
| 216 | Combination Sum III | Medium | |
| 218 | The Skyline Problem | Hard | |
| 233 | Number of Digit One | Hard | |
| 252 | Meeting Rooms | Easy | |
| 257 | Binary Tree Paths | Easy | |
| 260 | Single Number III | Medium | |
| 262 | Trips and Users | Hard | |
| 263 | Ugly Number | Easy | |
| 264 | Ugly Number II | Medium | |
| 271 | Encode and Decode Strings | Medium | |
| 277 | Find the Celebrity | Medium | |
| 279 | Perfect Squares | Medium | |
| 286 | Walls and Gates | Medium | |
| 289 | Game of Life | Medium | |
| 290 | Word Pattern | Easy | |
| 299 | Bulls and Cows | Medium | |
| 304 | Range Sum Query 2D - Immutable | Medium | |
| 310 | Minimum Height Trees | Medium | |
| 314 | Binary Tree Vertical Order Traversal | Medium | |
| 315 | Count of Smaller Numbers After Self | Hard | |
| 319 | Bulb Switcher | Medium | |
| 326 | Power of Three | Easy | |
| 329 | Longest Increasing Path in a Matrix | Hard | |
| 338 | Counting Bits | Easy | |
| 339 | Nested List Weight Sum | Medium | |
| 341 | Flatten Nested List Iterator | Medium | |
| 342 | Power of Four | Easy | |
| 346 | Moving Average from Data Stream | Easy | |
| 350 | Intersection of Two Arrays II | Easy | |
| 359 | Logger Rate Limiter | Easy | |
| 362 | Design Hit Counter | Medium | |
| 367 | Valid Perfect Square | Easy | |
| 368 | Largest Divisible Subset | Medium | |
| 381 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | |
| 386 | Lexicographical Numbers | Medium | |
| 389 | Find the Difference | Easy | |
| 390 | Elimination Game | Medium | |
| 408 | Valid Word Abbreviation | Easy | |
| 409 | Longest Palindrome | Easy | |
| 419 | Battleships in a Board | Medium | |
| 432 | All O`one Data Structure | Hard | |
| 433 | Minimum Genetic Mutation | Medium | |
| 441 | Arranging Coins | Easy | |
| 442 | Find All Duplicates in an Array | Medium | |
| 445 | Add Two Numbers II | Medium | |
| 449 | Serialize and Deserialize BST | Medium | |
| 452 | Minimum Number of Arrows to Burst Balloons | Medium | |
| 463 | Island Perimeter | Easy | |
| 475 | Heaters | Medium | |
| 502 | IPO | Hard | |
| 504 | Base 7 | Easy | |
| 508 | Most Frequent Subtree Sum | Medium | |
| 2036 | Maximum Alternating Subarray Sum | Medium | |
| 517 | Super Washing Machines | Hard | |
| 523 | Continuous Subarray Sum | Medium | |
| 529 | Minesweeper | Medium | |
| 532 | K-diff Pairs in an Array | Medium | |
| 535 | Encode and Decode TinyURL | Medium | |
| 536 | Construct Binary Tree from String | Medium | |
| 537 | Complex Number Multiplication | Medium | |
| 538 | Convert BST to Greater Tree | Medium | |
| 541 | Reverse String II | Easy | |
| 553 | Optimal Division | Medium | |
| 557 | Reverse Words in a String III | Easy | |
| 561 | Array Partition | Easy | |
| 572 | Subtree of Another Tree | Easy | |
| 579 | Find Cumulative Salary of an Employee | Hard | |
| 594 | Longest Harmonious Subsequence | Easy | |
| 606 | Construct String from Binary Tree | Medium | |
| 610 | Triangle Judgement | Easy | |
| 611 | Valid Triangle Number | Medium | |
| 626 | Exchange Seats | Medium | |
| 628 | Maximum Product of Three Numbers | Easy | |
| 630 | Course Schedule III | Hard | |
| 633 | Sum of Square Numbers | Medium | |
| 640 | Solve the Equation | Medium | |
| 642 | Design Search Autocomplete System | Hard | |
| 646 | Maximum Length of Pair Chain | Medium | |
| 650 | 2 Keys Keyboard | Medium | |
| 652 | Find Duplicate Subtrees | Medium | |
| 663 | Equal Tree Partition | Medium | |
| 670 | Maximum Swap | Medium | |
| 675 | Cut Off Trees for Golf Event | Hard | |
| 684 | Redundant Connection | Medium | |
| 698 | Partition to K Equal Sum Subsets | Medium | |
| 711 | Number of Distinct Islands II | Hard | |
| 716 | Max Stack | Hard | |
| 719 | Find K-th Smallest Pair Distance | Hard | |
| 729 | My Calendar I | Medium | |
| 738 | Monotone Increasing Digits | Medium | |
| 740 | Delete and Earn | Medium | |
| 742 | Closest Leaf in a Binary Tree | Medium | |
| 743 | Network Delay Time | Medium | |
| 428 | Serialize and Deserialize N-ary Tree | Hard | |
| 762 | Prime Number of Set Bits in Binary Representation | Easy | |
| 700 | Search in a Binary Search Tree | Easy | |
| 701 | Insert into a Binary Search Tree | Medium | |
| 772 | Basic Calculator III | Hard | |
| 775 | Global and Local Inversions | Medium | |
| 776 | Split BST | Medium | |
| 778 | Swim in Rising Water | Hard | |
| 797 | All Paths From Source to Target | Medium | |
| 801 | Minimum Swaps To Make Sequences Increasing | Hard | |
| 819 | Most Common Word | Easy | |
| 707 | Design Linked List | Medium | |
| 841 | Keys and Rooms | Medium | |
| 842 | Split Array into Fibonacci Sequence | Medium | |
| 843 | Guess the Word | Hard | |
| 844 | Backspace String Compare | Easy | |
| 851 | Loud and Rich | Medium | |
| 853 | Car Fleet | Medium | |
| 860 | Lemonade Change | Easy | |
| 862 | Shortest Subarray with Sum at Least K | Hard | |
| 867 | Transpose Matrix | Easy | |
| 878 | Nth Magical Number | Hard | |
| 890 | Find and Replace Pattern | Medium | |
| 895 | Maximum Frequency Stack | Hard | |
| 899 | Orderly Queue | Hard | |
| 902 | Numbers At Most N Given Digit Set | Hard | |
| 918 | Maximum Sum Circular Subarray | Medium | |
| 922 | Sort Array By Parity II | Easy | |
| 926 | Flip String to Monotone Increasing | Medium | |
| 933 | Number of Recent Calls | Easy | |
| 934 | Shortest Bridge | Medium | |
| 947 | Most Stones Removed with Same Row or Column | Medium | |
| 957 | Prison Cells After N Days | Medium | |
| 974 | Subarray Sums Divisible by K | Medium | |
| 979 | Distribute Coins in Binary Tree | Medium | |
| 980 | Unique Paths III | Hard | |
| 983 | Minimum Cost For Tickets | Medium | |
| 986 | Interval List Intersections | Medium | |
| 997 | Find the Town Judge | Easy | |
| 1000 | Minimum Cost to Merge Stones | Hard | |
| 1002 | Find Common Characters | Easy | |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | Medium | |
| 1060 | Missing Element in Sorted Array | Medium | |
| 1062 | Longest Repeating Substring | Medium | |
| 1067 | Digit Count in Range | Hard | |
| 1086 | High Five | Easy | |
| 1065 | Index Pairs of a String | Easy | |
| 1022 | Sum of Root To Leaf Binary Numbers | Easy | |
| 1085 | Sum of Digits in the Minimum Number | Easy | |
| 1099 | Two Sum Less Than K | Easy | |
| 1100 | Find K-Length Substrings With No Repeated Characters | Medium | |
| 1118 | Number of Days in a Month | Easy | |
| 1119 | Remove Vowels from a String | Easy | |
| 1134 | Armstrong Number | Easy | |
| 1120 | Maximum Average Subtree | Medium | |
| 1026 | Maximum Difference Between Node and Ancestor | Medium | |
| 1028 | Recover a Tree From Preorder Traversal | Hard | |
| 1133 | Largest Unique Number | Easy | |
| 1102 | Path With Maximum Minimum Value | Medium | |
| 1135 | Connecting Cities With Minimum Cost | Medium | |
| 1035 | Uncrossed Lines | Medium | |
| 1160 | Find Words That Can Be Formed by Characters | Easy | |
| 1044 | Longest Duplicate Substring | Hard | |
| 1166 | Design File System | Medium | |
| 1167 | Minimum Cost to Connect Sticks | Medium | |
| 1046 | Last Stone Weight | Easy | |
| 1050 | Actors and Directors Who Cooperated At Least Three Times | Easy | |
| 1054 | Distant Barcodes | Medium | |
| 1074 | Number of Submatrices That Sum to Target | Hard | |
| 1214 | Two Sum BSTs | Medium | |
| 1069 | Product Sales Analysis II | Easy | |
| 1080 | Insufficient Nodes in Root to Leaf Paths | Medium | |
| 1092 | Shortest Common Supersequence | Hard | |
| 1082 | Sales Analysis I | Easy | |
| 1083 | Sales Analysis II | Easy | |
| 1084 | Sales Analysis III | Easy | |
| 550 | Game Play Analysis IV | Medium | |
| 1094 | Car Pooling | Medium | |
| 1095 | Find in Mountain Array | Hard | |
| 1106 | Parsing A Boolean Expression | Hard | |
| 1259 | Handshakes That Don't Cross | Hard | |
| 1288 | Remove Covered Intervals | Medium | |
| 1129 | Shortest Path with Alternating Colors | Medium | |
| 1137 | N-th Tribonacci Number | Easy | |
| 1315 | Sum of Nodes with Even-Valued Grandparent | Medium | |
| 1141 | User Activity for the Past 30 Days I | Easy | |
| 1146 | Snapshot Array | Medium | |
| 1155 | Number of Dice Rolls With Target Sum | Medium | |
| 1362 | Closest Divisors | Medium | |
| 1363 | Largest Multiple of Three | Hard | |
| 1164 | Product Price at a Given Date | Medium | |
| 1175 | Prime Arrangements | Easy | |
| 1176 | Diet Plan Performance | Easy | |
| 1186 | Maximum Subarray Sum with One Deletion | Medium | |
| 1954 | Minimum Garden Perimeter to Collect Enough Apples | Medium | |
| 1179 | Reformat Department Table | Easy | |
| 1405 | Longest Happy String | Medium | |
| 1944 | Number of Visible People in a Queue | Hard | |
| 1211 | Queries Quality and Percentage | Easy | |
| 1233 | Remove Sub-Folders from the Filesystem | Medium | |
| 1249 | Minimum Remove to Make Valid Parentheses | Medium | |
| 1255 | Maximum Score Words Formed by Letters | Hard | |
| 1260 | Shift 2D Grid | Easy | |
| 2215 | Find the Difference of Two Arrays | Easy | |
| 1275 | Find Winner on a Tic Tac Toe Game | Easy | |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | Hard | |
| 2305 | Fair Distribution of Cookies | Medium | |
| 1304 | Find N Unique Integers Sum up to Zero | Easy | |
| 1305 | All Elements in Two Binary Search Trees | Medium | |
| 1311 | Get Watched Videos by Your Friends | Medium | |
| 1303 | Find the Team Size | Easy | |
| 1319 | Number of Operations to Make Network Connected | Medium | |
| 1325 | Delete Leaves With a Given Value | Medium | |
| 1326 | Minimum Number of Taps to Open to Water a Garden | Hard | |
| 1321 | Restaurant Growth | Medium | |
| 1332 | Remove Palindromic Subsequences | Easy | |
| 1335 | Minimum Difficulty of a Job Schedule | Hard | |
| 1358 | Number of Substrings Containing All Three Characters | Medium | |
| 1327 | List the Products Ordered in a Period | Easy | |
| 1337 | The K Weakest Rows in a Matrix | Easy | |
| 1341 | Movie Rating | Medium | |
| 1350 | Students With Invalid Departments | Easy | |
| 1365 | How Many Numbers Are Smaller Than the Current Number | Easy | |
| 1392 | Longest Happy Prefix | Hard | |
| 1395 | Count Number of Teams | Medium | |
| 1404 | Number of Steps to Reduce a Number in Binary Representation to One | Medium | |
| 1408 | String Matching in an Array | Easy | |
| 1409 | Queries on a Permutation With Key | Medium | |
| 1421 | NPV Queries | Easy | |
| 1457 | Pseudo-Palindromic Paths in a Binary Tree | Medium | |
| 1458 | Max Dot Product of Two Subsequences | Hard | |
| 1478 | Allocate Mailboxes | Hard | |
| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | |
| 1470 | Shuffle the Array | Easy | |
| 1472 | Design Browser History | Medium | |
| 1493 | Longest Subarray of 1's After Deleting One Element | Medium | |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | |
| 1497 | Check If Array Pairs Are Divisible by k | Medium | |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | Medium | |
| 1479 | Sales by Day of the Week | Hard | |
| 1485 | Clone Binary Tree With Random Pointer | Medium | |
| 1502 | Can Make Arithmetic Progression From Sequence | Easy | |
| 1490 | Clone N-ary Tree | Medium | |
| 1512 | Number of Good Pairs | Easy | |
| 1495 | Friendly Movies Streamed Last Month | Easy | |
| 1520 | Maximum Number of Non-Overlapping Substrings | Hard | |
| 1511 | Customer Order Frequency | Easy | |
| 1558 | Minimum Numbers of Function Calls to Make Target Array | Medium | |
| 1547 | Minimum Cost to Cut a Stick | Hard | |
| 1533 | Find the Index of the Large Integer | Medium | |
| 1574 | Shortest Subarray to be Removed to Make Array Sorted | Medium | |
| 1584 | Min Cost to Connect All Points | Medium | |
| 1571 | Warehouse Manager | Easy | |
| 1601 | Maximum Number of Achievable Transfer Requests | Hard | |
| 1621 | Number of Sets of K Non-Overlapping Line Segments | Medium | |
| 1597 | Build Binary Expression Tree From Infix Expression | Hard | |
| 1614 | Maximum Nesting Depth of the Parentheses | Easy | |
| 1636 | Sort Array by Increasing Frequency | Easy | |
| 1631 | Path With Minimum Effort | Medium | |
| 1652 | Defuse the Bomb | Easy | |
| 1613 | Find the Missing IDs | Medium | |
| 1623 | All Valid Triplets That Can Represent a Country | Easy | |
| 1670 | Design Front Middle Back Queue | Medium | |
| 1628 | Design an Expression Tree With Evaluate Function | Medium | |
| 1634 | Add Two Polynomials Represented as Linked Lists | Medium | |
| 1658 | Minimum Operations to Reduce X to Zero | Medium | |
| 1679 | Max Number of K-Sum Pairs | Medium | |
| 1680 | Concatenation of Consecutive Binary Numbers | Medium | |
| 1700 | Number of Students Unable to Eat Lunch | Easy | |
| 1695 | Maximum Erasure Value | Medium | |
| 1676 | Lowest Common Ancestor of a Binary Tree IV | Medium | |
| 1723 | Find Minimum Time to Finish All Jobs | Hard | |
| 1683 | Invalid Tweets | Easy | |
| 1732 | Find the Highest Altitude | Easy | |
| 1734 | Decode XORed Permutation | Medium | |
| 1735 | Count Ways to Make Array With Product | Hard | |
| 1699 | Number of Calls Between Two Persons | Medium | |
| 1750 | Minimum Length of String After Deleting Similar Ends | Medium | |
| 1764 | Form Array by Concatenating Subarrays of Another Array | Medium | |
| 1731 | The Number of Employees Which Report to Each Employee | Easy | |
| 1740 | Find Distance in a Binary Tree | Medium | |
| 1761 | Minimum Degree of a Connected Trio in a Graph | Hard | |
| 1779 | Find Nearest Point That Has the Same X or Y Coordinate | Easy | |
| 1782 | Count Pairs Of Nodes | Hard | |
| 1741 | Find Total Time Spent by Each Employee | Easy | |
| 1772 | Sort Features by Popularity | Medium | |
| 1777 | Product's Price for Each Store | Easy | |
| 1783 | Grand Slam Titles | Medium | |
| 1788 | Maximize the Beauty of the Garden | Hard | |
| 1795 | Rearrange Products Table | Easy | |
| 1846 | Maximum Element After Decreasing and Rearranging | Medium | |
| 1847 | Closest Room | Hard | |
| 1809 | Ad-Free Sessions | Easy | |
| 1833 | Maximum Ice Cream Bars | Medium | |
| 1811 | Find Interview Candidates | Medium | |
| 1842 | Next Palindrome Using Same Digits | Hard | |
| 1852 | Distinct Numbers in Each Subarray | Medium | |
| 1886 | Determine Whether Matrix Can Be Obtained By Rotation | Easy | |
| 1889 | Minimum Space Wasted From Packaging | Hard | |
| 1910 | Remove All Occurrences of a Substring | Medium | |
| 1903 | Largest Odd Number in String | Easy | |
| 1926 | Nearest Exit from Entrance in Maze | Medium | |
| 1901 | Find a Peak Element II | Medium | |
| 1920 | Build Array from Permutation | Easy | |
| 1923 | Longest Common Subpath | Hard | |
| 1942 | The Number of the Smallest Unoccupied Chair | Medium | |
| 2297 | Jump Game VIII | Medium | |
| 1930 | Unique Length-3 Palindromic Subsequences | Medium | |
| 2307 | Check for Contradictions in Equations | Hard | |
| 1950 | Maximum of Minimum Values in All Subarrays | Medium | |
| 1958 | Check if Move is Legal | Medium | |
| 1955 | Count Number of Special Subsequences | Hard | |
| 1976 | Number of Ways to Arrive at Destination | Medium | |
| 1981 | Minimize the Difference Between Target and Chosen Elements | Medium | |
| 1984 | Minimum Difference Between Highest and Lowest of K Scores | Easy | |
| 2006 | Count Number of Pairs With Absolute Difference K | Easy | |
| 1971 | Find if Path Exists in Graph | Easy | |
| 1998 | GCD Sort of an Array | Hard | |
| 2012 | Sum of Beauty in the Array | Medium | |
| 2028 | Find Missing Observations | Medium | |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | |
| 2053 | Kth Distinct String in an Array | Easy | |
| 2064 | Minimized Maximum of Products Distributed to Any Store | Medium | |
| 2075 | Decode the Slanted Ciphertext | Medium | |
| 2100 | Find Good Days to Rob the Bank | Medium | |
| 2102 | Sequentially Ordinal Rank Tracker | Hard | |
| 2115 | Find All Possible Recipes from Given Supplies | Medium | |
| 2109 | Adding Spaces to a String | Medium | |
| 2110 | Number of Smooth Descent Periods of a Stock | Medium | |
| 2111 | Minimum Operations to Make the Array K-Increasing | Hard | |
| 2130 | Maximum Twin Sum of a Linked List | Medium | |
| 2125 | Number of Laser Beams in a Bank | Medium | |
| 2145 | Count the Hidden Sequences | Medium | |
| 2134 | Minimum Swaps to Group All 1's Together II | Medium | |
| 2123 | Minimum Operations to Remove Adjacent Ones in Matrix | Hard | |
| 2160 | Minimum Sum of Four Digit Number After Splitting Digits | Easy | |
| 2195 | Append K Integers With Minimal Sum | Medium | |
| 2196 | Create Binary Tree From Descriptions | Medium | |
| 2197 | Replace Non-Coprime Numbers in Array | Hard | |
| 2207 | Maximize Number of Subsequences in a String | Medium | |
| 2173 | Longest Winning Streak | Hard | |
| 2222 | Number of Ways to Select Buildings | Medium | |
| 2223 | Sum of Scores of Built Strings | Hard | |
| 2261 | K Divisible Elements Subarrays | Medium | |
| 2262 | Total Appeal of A String | Hard | |
| 2256 | Minimum Average Difference | Medium | |
| 2266 | Count Number of Texts | Medium | |
| 2274 | Maximum Consecutive Floors Without Special Floors | Medium | |
| 2270 | Number of Ways to Split Array | Medium | |
| 2244 | Minimum Rounds to Complete All Tasks | Medium | |
| 2279 | Maximum Bags With Full Capacity of Rocks | Medium | |
| 2219 | Maximum Sum Score of Array | Medium | |
| 2228 | Users With Two Purchases Within Seven Days | Medium | |
| 2287 | Rearrange Characters to Make Target String | Easy | |
| 2238 | Number of Times a Driver Was a Passenger | Medium | |
| 2294 | Partition Array Such That Maximum Difference Is K | Medium | |
| 2295 | Replace Elements in an Array | Medium | |
| 2296 | Design a Text Editor | Hard | |
| 2300 | Successful Pairs of Spells and Potions | Medium | |
| 2322 | Minimum Score After Removals on a Tree | Hard | |
| 2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | |
| 2268 | Minimum Number of Keypresses | Medium | |
| 2336 | Smallest Number in Infinite Set | Medium | |
| 2337 | Move Pieces to Obtain a String | Medium | |
| 2333 | Minimum Sum of Squared Difference | Medium | |
| 2353 | Design a Food Rating System | Medium | |
| 2292 | Products With Three or More Orders in Two Consecutive Years | Medium | |
| 2364 | Count Number of Bad Pairs | Medium | |
| 2398 | Maximum Number of Robots Within Budget | Hard | |
| 2324 | Product Sales Analysis IV | Medium | |
| 2329 | Product Sales Analysis V | Easy | |
| 2375 | Construct Smallest Number From DI String | Medium | |
| 2323 | Find Minimum Time to Finish All Jobs II | Medium | |
| 2386 | Find the K-Sum of an Array | Hard | |
| 2380 | Time Needed to Rearrange a Binary String | Medium | |
| 2330 | Valid Palindrome IV | Medium | |
| 2340 | Minimum Adjacent Swaps to Make a Valid Array | Medium | |
| 2402 | Meeting Rooms III | Hard | |
| 2396 | Strictly Palindromic Number | Medium | |
| 2405 | Optimal Partition of String | Medium | |
| 2410 | Maximum Matching of Players With Trainers | Medium | |
| 2411 | Smallest Subarrays With Maximum Bitwise OR | Medium | |
| 2412 | Minimum Money Required Before Transactions | Hard | |
| 2394 | Employees With Deductions | Medium | |
| 2443 | Sum of Number and Its Reverse | Medium | |
| 2408 | Design SQL | Medium | |
| 2471 | Minimum Number of Operations to Sort a Binary Tree by Level | Medium | |
| 2465 | Number of Distinct Averages | Easy | |
| 2422 | Merge Operations to Turn Array Into a Palindrome | Medium | |
| 2485 | Find the Pivot Integer | Easy | |
| 2486 | Append Characters to String to Make Subsequence | Medium | |
| 2487 | Remove Nodes From Linked List | Medium | |
| 2501 | Longest Square Streak in an Array | Medium | |
| 2502 | Design Memory Allocator | Medium | |
| 2497 | Maximum Star Sum of a Graph | Medium | |
| 2482 | Difference Between Ones and Zeros in Row and Column | Medium | |
| 2474 | Customers With Strictly Increasing Purchases | Hard | |
| 2534 | Time Taken to Cross the Door | Hard | |
| 2527 | Find Xor-Beauty of Array | Medium | |
| 2578 | Split With Minimum Sum | Easy | |
| 2519 | Count the Number of K-Big Indices | Hard | |
| 2606 | Find the Substring With Maximum Cost | Medium | |
| 2641 | Cousins in Binary Tree II | Medium | |
| 2563 | Count the Number of Fair Pairs | Medium | |
| 2575 | Find the Divisibility Array of a String | Medium | |
| 2620 | Counter | Easy | |
| 2643 | Row With Maximum Ones | Easy | |
| 2638 | Count the Number of K-Free Subsets | Medium | |
| 2634 | Filter Elements from Array | Easy | |
| 2657 | Find the Prefix Common Array of Two Arrays | Medium | |
| 2704 | To Be Or Not To Be | Easy | |
| 2703 | Return Length of Arguments Passed | Easy | |
| 2747 | Count Zero Request Servers | Medium | |
| 2766 | Relocate Marbles | Medium | |
| 2762 | Continuous Subarrays | Medium | |
| 2816 | Double a Number Represented as a Linked List | Medium | |
| 2781 | Length of the Longest Valid Substring | Hard | |
| 2801 | Count Stepping Numbers in Range | Hard | |
| 2841 | Maximum Sum of Almost Unique Subarray | Medium | |
| 2830 | Maximize the Profit as the Salesman | Medium | |
| 2782 | Number of Unique Categories | Medium | |
| 2855 | Minimum Right Shifts to Sort the Array | Easy | |
| 2832 | Maximal Range That Each Element Is Maximum in It | Medium | |
| 2870 | Minimum Number of Operations to Make Array Empty | Medium | |
| 2916 | Subarrays Distinct Element Sum of Squares II | Hard | |
| 2898 | Maximum Linear Stock Score | Medium | |
| 2917 | Find the K-or of an Array | Easy | |
| 2926 | Maximum Balanced Subsequence Sum | Hard | |
| 2928 | Distribute Candies Among Children I | Easy | |
| 2937 | Make Three Strings Equal | Easy | |
| 2949 | Count Beautiful Substrings II | Hard | |
| 2947 | Count Beautiful Substrings I | Medium | |
| 2945 | Find Maximum Non-decreasing Array Length | Hard | |
| 2927 | Distribute Candies Among Children III | Hard | |
| 2973 | Find Number of Coins to Place in Tree Nodes | Hard | |
| 2952 | Minimum Number of Coins to be Added | Medium | |
| 3005 | Count Elements With Maximum Frequency | Easy | |
| 3014 | Minimum Number of Pushes to Type Word I | Easy | |
| 3016 | Minimum Number of Pushes to Type Word II | Medium | |
| 3020 | Find the Maximum Number of Elements in Subset | Medium | |
| 3032 | Count Numbers With Unique Digits II | Easy | |
| 3075 | Maximize Happiness of Selected Children | Medium | |
| 3081 | Replace Question Marks in String to Minimize Its Value | Medium | |
| 3134 | Find the Median of the Uniqueness Array | Hard | |
| 3092 | Most Frequent IDs | Medium | |
| 3113 | Find the Number of Subarrays Where Boundary Elements Are Maximum | Hard | |
| 3121 | Count the Number of Special Characters II | Medium | |
| 3120 | Count the Number of Special Characters I | Easy | |
| 3154 | Find Number of Ways to Reach the K-th Stair | Hard | |
| 3211 | Generate Binary Strings Without Adjacent Zeros | Medium | |
| 3194 | Minimum Average of Smallest and Largest Elements | Easy | |
| 3199 | Count Triplets with Even XOR Set Bits I | Easy | |
| 3215 | Count Triplets with Even XOR Set Bits II | Medium | |
| 840 | Magic Squares In Grid | Medium | |
| 2477 | Minimum Fuel Cost to Report to the Capital | Medium | |
| 1633 | Percentage of Users Attended a Contest | Easy | |
| 3217 | Delete Nodes From Linked List Present in Array | Medium | |
| 3043 | Find the Length of the Longest Common Prefix | Medium | |
| 1049 | Last Stone Weight II | Medium | |
| 2938 | Separate Black and White Balls | Medium | |
| 1975 | Maximum Matrix Sum | Medium | |
| 3369 | Design an Array Statistics Tracker | Hard | |
| 3366 | Minimum Array Sum | Medium | |
| 2054 | Two Best Non-Overlapping Events | Medium | |
| 2050 | Parallel Courses III | Hard | |
| 769 | Max Chunks To Make Sorted | Medium | |
| 2193 | Minimum Number of Moves to Make Palindrome | Hard | |
| 2348 | Number of Zero-Filled Subarrays | Medium | |
| 3396 | Minimum Number of Operations to Make Elements in Array Distinct | Easy | |
| 3407 | Substring Matching Pattern | Easy | |
| 1267 | Count Servers that Communicate | Medium | |
| 1462 | Course Schedule IV | Medium | |
| 3174 | Clear Digits | Easy | |
| 3455 | Shortest Matching Substring | Hard | |
| 1475 | Final Prices With a Special Discount in a Shop | Easy | |
| 3453 | Separate Squares I | Medium | |
| 3462 | Maximum Sum With at Most K Elements | Medium | |
| 3170 | Lexicographically Minimum String After Removing Stars | Medium | |
| 3461 | Check If Digits Are Equal in String After Operations I | Easy | |
| 2560 | House Robber IV | Medium | |
| 2226 | Maximum Candies Allocated to K Children | Medium | |
| 2170 | Minimum Operations to Make the Array Alternating | Medium | |
| 1848 | Minimum Distance to the Target Element | Easy | |
| 3531 | Count Covered Buildings | Medium | |
| 3392 | Count Subarrays of Length Three With a Condition | Easy | |
| 3234 | Count the Number of Substrings With Dominant Ones | Medium | |
| 3572 | Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values | Medium | |
| 3304 | Find the K-th Character in String Game I | Easy | |
| 3201 | Find the Maximum Length of Valid Subsequence I | Medium | |
| 2488 | Count Subarrays With Median K | Hard | |
| 808 | Soup Servings | Medium | |
| 3645 | Maximum Total from Optimal Activation Order | Medium | |
| 3639 | Minimum Time to Activate String | Medium | |
| 3605 | Minimum Stability Factor of Array | Hard | |
| 3637 | Trionic Array I | Easy | |
| 3636 | Threshold Majority Queries | Hard | |
| 3640 | Trionic Array II | Hard | |
| 3627 | Maximum Median Sum of Subsequences of Size 3 | Medium | |
| 3634 | Minimum Removals to Balance Array | Medium | |
| 837 | New 21 Game | Medium | |
| 3197 | Find the Minimum Area to Cover All Ones II | Hard | |
| 3648 | Minimum Sensors to Cover Grid | Medium | |
| 1488 | Avoid Flood in The City | Medium | |
| 3730 | Maximum Calories Burnt from Jumps | Medium | |
| 2910 | Minimum Number of Groups to Create a Valid Assignment | Medium | |
| 3767 | Maximize Points After Choosing K Tasks | Medium | |
| 3785 | Minimum Swaps to Avoid Forbidden Values | Hard | |
| 3786 | Total Sum of Interaction Cost in Tree Groups | Hard | |
| 3781 | Maximum Score After Binary Swaps | Medium | |
| 3794 | Reverse String Prefix | Easy | |
| 3806 | Maximum Bitwise AND After Increment Operations | Hard | |
| 3814 | Maximum Capacity Within Budget | Medium | |
| 3010 | Divide an Array Into Subarrays With Minimum Cost I | Easy | |
| 3864 | Minimum Cost to Partition a Binary String | Hard | |
| 3863 | Minimum Operations to Sort a String | Medium | |
| 3867 | Sum of GCD of Formed Pairs | Medium | |
| 3920 | Maximize Fixed Points After Deletions | Hard | |
| 3927 | Minimize Array Sum Using Divisible Replacements | Medium | |
| 3922 | Minimum Flips to Make Binary String Coherent | Medium | |
| 3948 | Lexicographically Maximum MEX Array | Hard | |
| 3942 | Minimum Operations to Sort a Permutation | Medium | |
| 3952 | Maximum Total Value of Covered Indices | Medium | |
| 3976 | Maximum Subarray Sum After Multiplier | Medium | |
| 107 | Binary Tree Level Order Traversal II | Medium | |
| 117 | Populating Next Right Pointers in Each Node II | Medium | |
| 154 | Find Minimum in Rotated Sorted Array II | Hard | |
| 159 | Longest Substring with At Most Two Distinct Characters | Medium | |
| 164 | Maximum Gap | Medium | |
| 166 | Fraction to Recurring Decimal | Medium | |
| 193 | Valid Phone Numbers | Easy | |
| 201 | Bitwise AND of Numbers Range | Medium | |
| 220 | Contains Duplicate III | Hard | |
| 222 | Count Complete Tree Nodes | Easy | |
| 243 | Shortest Word Distance | Easy | |
| 261 | Graph Valid Tree | Medium | |
| 272 | Closest Binary Search Tree Value II | Hard | |
| 296 | Best Meeting Point | Hard | |
| 301 | Remove Invalid Parentheses | Hard | |
| 309 | Best Time to Buy and Sell Stock with Cooldown | Medium | |
| 317 | Shortest Distance from All Buildings | Hard | |
| 318 | Maximum Product of Word Lengths | Medium | |
| 321 | Create Maximum Number | Hard | |
| 324 | Wiggle Sort II | Medium | |
| 325 | Maximum Size Subarray Sum Equals k | Medium | |
| 327 | Count of Range Sum | Hard | |
| 330 | Patching Array | Hard | |
| 336 | Palindrome Pairs | Hard | |
| 340 | Longest Substring with At Most K Distinct Characters | Medium | |
| 343 | Integer Break | Medium | |
| 366 | Find Leaves of Binary Tree | Medium | |
| 369 | Plus One Linked List | Medium | |
| 372 | Super Pow | Medium | |
| 374 | Guess Number Higher or Lower | Easy | |
| 377 | Combination Sum IV | Medium | |
| 384 | Shuffle an Array | Medium | |
| 385 | Mini Parser | Medium | |
| 388 | Longest Absolute File Path | Medium | |
| 398 | Random Pick Index | Medium | |
| 404 | Sum of Left Leaves | Easy | |
| 405 | Convert a Number to Hexadecimal | Easy | |
| 406 | Queue Reconstruction by Height | Medium | |
| 413 | Arithmetic Slices | Medium | |
| 420 | Strong Password Checker | Hard | |
| 421 | Maximum XOR of Two Numbers in an Array | Medium | |
| 436 | Find Right Interval | Medium | |
| 446 | Arithmetic Slices II - Subsequence | Hard | |
| 453 | Minimum Moves to Equal Array Elements | Medium | |
| 454 | 4Sum II | Medium | |
| 457 | Circular Array Loop | Medium | |
| 461 | Hamming Distance | Easy | |
| 462 | Minimum Moves to Equal Array Elements II | Medium | |
| 464 | Can I Win | Medium | |
| 465 | Optimal Account Balancing | Hard | |
| 468 | Validate IP Address | Medium | |
| 480 | Sliding Window Median | Hard | |
| 481 | Magical String | Medium | |
| 500 | Keyboard Row | Easy | |
| 506 | Relative Ranks | Easy | |
| 507 | Perfect Number | Easy | |
| 513 | Find Bottom Left Tree Value | Medium | |
| 515 | Find Largest Value in Each Tree Row | Medium | |
| 526 | Beautiful Arrangement | Medium | |
| 539 | Minimum Time Difference | Medium | |
| 554 | Brick Wall | Medium | |
| 564 | Find the Closest Palindrome | Hard | |
| 581 | Shortest Unsorted Continuous Subarray | Medium | |
| 582 | Kill Process | Medium | |
| 583 | Delete Operation for Two Strings | Medium | |
| 585 | Investments in 2016 | Medium | |
| 587 | Erect the Fence | Hard | |
| 601 | Human Traffic of Stadium | Hard | |
| 602 | Friend Requests II: Who Has the Most Friends | Medium | |
| 607 | Sales Person | Easy | |
| 620 | Not Boring Movies | Easy | |
| 627 | Swap Sex of Employees | Easy | |
| 638 | Shopping Offers | Medium | |
| 649 | Dota2 Senate | Medium | |
| 655 | Print Binary Tree | Medium | |
| 664 | Strange Printer | Hard | |
| 669 | Trim a Binary Search Tree | Medium | |
| 673 | Number of Longest Increasing Subsequence | Medium | |
| 686 | Repeated String Match | Medium | |
| 712 | Minimum ASCII Delete Sum for Two Strings | Medium | |
| 714 | Best Time to Buy and Sell Stock with Transaction Fee | Medium | |
| 715 | Range Module | Hard | |
| 718 | Maximum Length of Repeated Subarray | Medium | |
| 720 | Longest Word in Dictionary | Medium | |
| 726 | Number of Atoms | Hard | |
| 731 | My Calendar II | Medium | |
| 744 | Find Smallest Letter Greater Than Target | Easy | |
| 754 | Reach a Number | Medium | |
| 426 | Convert Binary Search Tree to Sorted Doubly Linked List | Medium | |
| 759 | Employee Free Time | Hard | |
| 429 | N-ary Tree Level Order Traversal | Medium | |
| 427 | Construct Quad Tree | Medium | |
| 779 | K-th Symbol in Grammar | Medium | |
| 780 | Reaching Points | Hard | |
| 781 | Rabbits in Forest | Medium | |
| 784 | Letter Case Permutation | Medium | |
| 788 | Rotated Digits | Medium | |
| 792 | Number of Matching Subsequences | Medium | |
| 705 | Design HashSet | Easy | |
| 812 | Largest Triangle Area | Easy | |
| 814 | Binary Tree Pruning | Medium | |
| 817 | Linked List Components | Medium | |
| 826 | Most Profit Assigning Work | Medium | |
| 828 | Count Unique Characters of All Substrings of a Given String | Hard | |
| 832 | Flipping an Image | Easy | |
| 834 | Sum of Distances in Tree | Hard | |
| 489 | Robot Room Cleaner | Hard | |
| 836 | Rectangle Overlap | Easy | |
| 839 | Similar String Groups | Hard | |
| 845 | Longest Mountain in Array | Medium | |
| 846 | Hand of Straights | Medium | |
| 847 | Shortest Path Visiting All Nodes | Hard | |
| 849 | Maximize Distance to Closest Person | Medium | |
| 857 | Minimum Cost to Hire K Workers | Hard | |
| 869 | Reordered Power of 2 | Medium | |
| 870 | Advantage Shuffle | Medium | |
| 872 | Leaf-Similar Trees | Easy | |
| 874 | Walking Robot Simulation | Medium | |
| 879 | Profitable Schemes | Hard | |
| 880 | Decoded String at Index | Medium | |
| 885 | Spiral Matrix III | Medium | |
| 887 | Super Egg Drop | Hard | |
| 888 | Fair Candy Swap | Easy | |
| 889 | Construct Binary Tree from Preorder and Postorder Traversal | Medium | |
| 894 | All Possible Full Binary Trees | Medium | |
| 896 | Monotonic Array | Easy | |
| 897 | Increasing Order Search Tree | Easy | |
| 905 | Sort Array By Parity | Easy | |
| 910 | Smallest Range II | Medium | |
| 932 | Beautiful Array | Medium | |
| 935 | Knight Dialer | Medium | |
| 938 | Range Sum of BST | Easy | |
| 941 | Valid Mountain Array | Easy | |
| 945 | Minimum Increment to Make Array Unique | Medium | |
| 946 | Validate Stack Sequences | Medium | |
| 950 | Reveal Cards In Increasing Order | Medium | |
| 951 | Flip Equivalent Binary Trees | Medium | |
| 953 | Verifying an Alien Dictionary | Easy | |
| 958 | Check Completeness of a Binary Tree | Medium | |
| 959 | Regions Cut By Slashes | Medium | |
| 976 | Largest Perimeter Triangle | Easy | |
| 993 | Cousins in Binary Tree | Easy | |
| 995 | Minimum Number of K Consecutive Bit Flips | Hard | |
| 1019 | Next Greater Node In Linked List | Medium | |
| 1020 | Number of Enclaves | Medium | |
| 1025 | Divisor Game | Easy | |
| 1027 | Longest Arithmetic Subsequence | Medium | |
| 1029 | Two City Scheduling | Medium | |
| 1032 | Stream of Characters | Hard | |
| 1039 | Minimum Score Triangulation of Polygon | Medium | |
| 1161 | Maximum Level Sum of a Binary Tree | Medium | |
| 1162 | As Far from Land as Possible | Medium | |
| 1041 | Robot Bounded In Circle | Medium | |
| 1043 | Partition Array for Maximum Sum | Medium | |
| 1048 | Longest String Chain | Medium | |
| 1163 | Last Substring in Lexicographical Order | Hard | |
| 1051 | Height Checker | Easy | |
| 1052 | Grumpy Bookstore Owner | Medium | |
| 1197 | Minimum Knight Moves | Medium | |
| 1075 | Project Employees I | Easy | |
| 1229 | Meeting Scheduler | Medium | |
| 1089 | Duplicate Zeros | Easy | |
| 1244 | Design A Leaderboard | Medium | |
| 511 | Game Play Analysis I | Easy | |
| 1105 | Filling Bookcase Shelves | Medium | |
| 1108 | Defanging an IP Address | Easy | |
| 1110 | Delete Nodes And Return Forest | Medium | |
| 1122 | Relative Sort Array | Easy | |
| 1123 | Lowest Common Ancestor of Deepest Leaves | Medium | |
| 1287 | Element Appearing More Than 25% In Sorted Array | Easy | |
| 1140 | Stone Game II | Medium | |
| 1329 | Sort the Matrix Diagonally | Medium | |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | Medium | |
| 1169 | Invalid Transactions | Medium | |
| 1360 | Number of Days Between Two Dates | Easy | |
| 1550 | Three Consecutive Odds | Easy | |
| 1483 | Kth Ancestor of a Tree Node | Hard | |
| 1190 | Reverse Substrings Between Each Pair of Parentheses | Medium | |
| 2139 | Minimum Moves to Reach Target Score | Medium | |
| 1514 | Path with Maximum Probability | Medium | |
| 1204 | Last Person to Fit in the Bus | Medium | |
| 1219 | Path with Maximum Gold | Medium | |
| 1232 | Check If It Is a Straight Line | Easy | |
| 2273 | Find Resultant Array After Removing Anagrams | Easy | |
| 1225 | Report Contiguous Dates | Hard | |
| 1248 | Count Number of Nice Subarrays | Medium | |
| 1254 | Number of Closed Islands | Medium | |
| 1282 | Group the People Given the Group Size They Belong To | Medium | |
| 1290 | Convert Binary Number in a Linked List to Integer | Easy | |
| 1292 | Maximum Side Length of a Square with Sum Less than or Equal to Threshold | Medium | |
| 1295 | Find Numbers with Even Number of Digits | Easy | |
| 1310 | XOR Queries of a Subarray | Medium | |
| 1312 | Minimum Insertion Steps to Make a String Palindrome | Hard | |
| 1342 | Number of Steps to Reduce a Number to Zero | Easy | |
| 1345 | Jump Game IV | Hard | |
| 1323 | Maximum 69 Number | Easy | |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | |
| 1356 | Sort Integers by The Number of 1 Bits | Easy | |
| 1339 | Maximum Product of Splitted Binary Tree | Medium | |
| 1346 | Check If N and Its Double Exist | Easy | |
| 1347 | Minimum Number of Steps to Make Two Strings Anagram | Medium | |
| 1372 | Longest ZigZag Path in a Binary Tree | Medium | |
| 1352 | Product of the Last K Numbers | Medium | |
| 1367 | Linked List in Binary Tree | Medium | |
| 1376 | Time Needed to Inform All Employees | Medium | |
| 1381 | Design a Stack With Increment Operation | Medium | |
| 1389 | Create Target Array in the Given Order | Easy | |
| 1396 | Design Underground System | Medium | |
| 1422 | Maximum Score After Splitting a String | Easy | |
| 1424 | Diagonal Traverse II | Medium | |
| 1448 | Count Good Nodes in Binary Tree | Medium | |
| 1436 | Destination City | Easy | |
| 1463 | Cherry Pickup II | Hard | |
| 1464 | Maximum Product of Two Elements in an Array | Easy | |
| 1481 | Least Number of Unique Integers after K Removals | Medium | |
| 1509 | Minimum Difference Between Largest and Smallest Value in Three Moves | Medium | |
| 1523 | Count Odd Numbers in an Interval Range | Easy | |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | Hard | |
| 1531 | String Compression II | Hard | |
| 1518 | Water Bottles | Easy | |
| 1529 | Minimum Suffix Flips | Medium | |
| 1534 | Count Good Triplets | Easy | |
| 1544 | Make The String Great | Easy | |
| 1545 | Find Kth Bit in Nth Binary String | Medium | |
| 1572 | Matrix Diagonal Sum | Easy | |
| 1561 | Maximum Number of Coins You Can Get | Medium | |
| 1567 | Maximum Length of Subarray With Positive Product | Medium | |
| 1588 | Sum of All Odd Length Subarrays | Easy | |
| 1570 | Dot Product of Two Sparse Vectors | Medium | |
| 1608 | Special Array With X Elements Greater Than or Equal X | Easy | |
| 1637 | Widest Vertical Area Between Two Points Containing No Points | Easy | |
| 1668 | Maximum Repeating Substring | Easy | |
| 1669 | Merge In Between Linked Lists | Medium | |
| 1671 | Minimum Number of Removals to Make Mountain Array | Hard | |
| 1646 | Get Maximum in Generated Array | Easy | |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | Medium | |
| 1657 | Determine if Two Strings Are Close | Medium | |
| 1662 | Check If Two String Arrays are Equivalent | Easy | |
| 1685 | Sum of Absolute Differences in a Sorted Array | Medium | |
| 1672 | Richest Customer Wealth | Easy | |
| 1688 | Count of Matches in Tournament | Easy | |
| 1689 | Partitioning Into Minimum Number Of Deci-Binary Numbers | Medium | |
| 1716 | Calculate Money in Leetcode Bank | Easy | |
| 1717 | Maximum Score From Removing Substrings | Medium | |
| 1718 | Construct the Lexicographically Largest Valid Sequence | Medium | |
| 1751 | Maximum Number of Events That Can Be Attended II | Hard | |
| 1760 | Minimum Limit of Balls in a Bag | Medium | |
| 1769 | Minimum Number of Operations to Move All Balls to Each Box | Medium | |
| 1762 | Buildings With an Ocean View | Medium | |
| 1790 | Check if One String Swap Can Make Strings Equal | Easy | |
| 1791 | Find Center of Star Graph | Easy | |
| 1823 | Find the Winner of the Circular Game | Medium | |
| 1832 | Check if the Sentence Is Pangram | Easy | |
| 1834 | Single-Threaded CPU | Medium | |
| 1859 | Sorting the Sentence | Easy | |
| 1854 | Maximum Population Year | Easy | |
| 1876 | Substrings of Size Three with Distinct Characters | Easy | |
| 1882 | Process Tasks Using Servers | Medium | |
| 1909 | Remove One Element to Make the Array Strictly Increasing | Easy | |
| 1963 | Minimum Number of Swaps to Make the String Balanced | Medium | |
| 1969 | Minimum Non-Zero Product of the Array Elements | Medium | |
| 1986 | Minimum Number of Work Sessions to Finish the Tasks | Medium | |
| 2000 | Reverse Prefix of Word | Easy | |
| 2022 | Convert 1D Array Into 2D Array | Easy | |
| 2011 | Final Value of Variable After Performing Operations | Easy | |
| 2013 | Detect Squares | Medium | |
| 2037 | Minimum Number of Moves to Seat Everyone | Easy | |
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | |
| 2073 | Time Needed to Buy Tickets | Easy | |
| 2099 | Find Subsequence of Length K With the Largest Sum | Easy | |
| 2101 | Detonate the Maximum Bombs | Medium | |
| 2092 | Find All People With Secret | Hard | |
| 2095 | Delete the Middle Node of a Linked List | Medium | |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | Medium | |
| 2116 | Check if a Parentheses String Can Be Valid | Medium | |
| 2127 | Maximum Employees to Be Invited to a Meeting | Hard | |
| 2140 | Solving Questions With Brainpower | Medium | |
| 2181 | Merge Nodes in Between Zeros | Medium | |
| 2220 | Minimum Bit Flips to Convert Number | Easy | |
| 2259 | Remove Digit From Number to Maximize Result | Easy | |
| 2258 | Escape the Spreading Fire | Hard | |
| 2239 | Find Closest Number to Zero | Easy | |
| 2246 | Longest Path With Different Adjacent Characters | Hard | |
| 2236 | Root Equals Sum of Children | Easy | |
| 2325 | Decode the Message | Easy | |
| 2352 | Equal Row and Column Pairs | Medium | |
| 2360 | Longest Cycle in a Graph | Hard | |
| 2401 | Longest Nice Subarray | Medium | |
| 2413 | Smallest Even Multiple | Easy | |
| 2356 | Number of Unique Subjects Taught by Each Teacher | Easy | |
| 2441 | Largest Positive Integer That Exists With Its Negative | Easy | |
| 2444 | Count Subarrays With Fixed Bounds | Hard | |
| 2439 | Minimize Maximum of Array | Medium | |
| 2449 | Minimum Number of Operations to Make Arrays Similar | Hard | |
| 2460 | Apply Operations to an Array | Easy | |
| 2469 | Convert the Temperature | Easy | |
| 2468 | Split Message Based on Limit | Hard | |
| 2535 | Difference Between Element Sum and Digit Sum of an Array | Easy | |
| 2537 | Count the Number of Good Subarrays | Medium | |
| 2542 | Maximum Subsequence Score | Medium | |
| 2558 | Take Gifts From the Richest Pile | Easy | |
| 2597 | The Number of Beautiful Subsets | Medium | |
| 2616 | Minimize the Maximum Difference of Pairs | Medium | |
| 2621 | Sleep | Easy | |
| 2619 | Array Prototype Last | Easy | |
| 2629 | Function Composition | Easy | |
| 2635 | Apply Transform Over Each Element in Array | Easy | |
| 2653 | Sliding Subarray Beauty | Medium | |
| 2707 | Extra Characters in a String | Medium | |
| 2706 | Buy Two Chocolates | Easy | |
| 2622 | Cache With Time Limit | Medium | |
| 2665 | Counter II | Easy | |
| 2694 | Event Emitter | Medium | |
| 2742 | Painting the Walls | Hard | |
| 2769 | Find the Maximum Achievable Number | Easy | |
| 2799 | Count Complete Subarrays in an Array | Medium | |
| 2798 | Number of Employees Who Met the Target | Easy | |
| 2824 | Count Pairs Whose Sum is Less than Target | Easy | |
| 2864 | Maximum Odd Binary Number | Easy | |
| 2879 | Display the First Three Rows | Easy | |
| 2942 | Find Words Containing Character | Easy | |
| 2962 | Count Subarrays Where Max Element Appears at Least K Times | Medium | |
| 2958 | Length of Longest Subarray With at Most K Frequency | Medium | |
| 2966 | Divide Array Into Arrays With Max Difference | Medium | |
| 2997 | Minimum Number of Operations to Make Array XOR Equal to K | Medium | |
| 3108 | Minimum Cost Walk in Weighted Graph | Hard | |
| 3110 | Score of a String | Easy | |
| 3133 | Minimum Array End | Medium | |
| 3152 | Special Array II | Medium | |
| 3151 | Special Array I | Easy | |
| 3164 | Find the Number of Good Pairs II | Medium | |
| 3202 | Find the Maximum Length of Valid Subsequence II | Medium | |
| 1484 | Group Sold Products By The Date | Easy | |
| 978 | Longest Turbulent Subarray | Medium | |
| 2191 | Sort the Jumbled Numbers | Medium | |
| 400 | Nth Digit | Medium | |
| 1789 | Primary Department for Each Employee | Easy | |
| 2976 | Minimum Cost to Convert String I | Medium | |
| 2685 | Count the Number of Complete Components | Medium | |
| 1653 | Minimum Deletions to Make String Balanced | Medium | |
| 1216 | Valid Palindrome III | Hard | |
| 1460 | Make Two Arrays Equal by Reversing Subarrays | Easy | |
| 313 | Super Ugly Number | Medium | |
| 1508 | Range Sum of Sorted Subarray Sums | Medium | |
| 1851 | Minimum Interval to Include Each Query | Hard | |
| 2365 | Task Scheduler II | Medium | |
| 2977 | Minimum Cost to Convert String II | Hard | |
| 1221 | Split a String in Balanced Strings | Easy | |
| 2094 | Finding 3-Digit Even Numbers | Easy | |
| 2074 | Reverse Nodes in Even Length Groups | Medium | |
| 1568 | Minimum Number of Days to Disconnect Island | Hard | |
| 3235 | Check if the Rectangle Corner Is Reachable | Hard | |
| 3136 | Valid Word | Easy | |
| 365 | Water and Jug Problem | Medium | |
| 624 | Maximum Distance in Arrays | Medium | |
| 599 | Minimum Index Sum of Two Lists | Easy | |
| 2915 | Length of the Longest Subsequence That Sums to Target | Medium | |
| 1937 | Maximum Number of Points with Cost | Medium | |
| 1606 | Find Servers That Handled Most Number of Requests | Hard | |
| 3191 | Minimum Operations to Make Binary Array Elements Equal to One I | Medium | |
| 590 | N-ary Tree Postorder Traversal | Easy | |
| 697 | Degree of an Array | Easy | |
| 989 | Add to Array-Form of Integer | Easy | |
| 1410 | HTML Entity Parser | Medium | |
| 2334 | Subarray With Elements Greater Than Varying Threshold | Hard | |
| 1261 | Find Elements in a Contaminated Binary Tree | Medium | |
| 576 | Out of Boundary Paths | Medium | |
| 1172 | Dinner Plate Stacks | Hard | |
| 3281 | Maximize Score of Numbers in Ranges | Medium | |
| 3274 | Check if Two Chessboard Squares Have the Same Color | Easy | |
| 674 | Longest Continuous Increasing Subsequence | Easy | |
| 794 | Valid Tic-Tac-Toe State | Medium | |
| 3105 | Longest Strictly Increasing or Strictly Decreasing Subarray | Easy | |
| 2734 | Lexicographically Smallest String After Substring Operation | Medium | |
| 2602 | Minimum Operations to Make All Array Elements Equal | Medium | |
| 2049 | Count Nodes With the Highest Score | Medium | |
| 2419 | Longest Subarray With Maximum Bitwise AND | Medium | |
| 1371 | Find the Longest Substring Containing Vowels in Even Counts | Medium | |
| 3193 | Count the Number of Inversions | Hard | |
| 884 | Uncommon Words from Two Sentences | Easy | |
| 170 | Two Sum III - Data structure design | Easy | |
| 2724 | Sort By | Easy | |
| 1525 | Number of Good Ways to Split a String | Medium | |
| 2290 | Minimum Obstacle Removal to Reach Corner | Hard | |
| 2192 | All Ancestors of a Node in a Directed Acyclic Graph | Medium | |
| 813 | Largest Sum of Averages | Medium | |
| 1625 | Lexicographically Smallest String After Applying Operations | Medium | |
| 2227 | Encrypt and Decrypt Strings | Hard | |
| 2751 | Robot Collisions | Hard | |
| 2416 | Sum of Prefix Scores of Strings | Hard | |
| 3163 | String Compression III | Medium | |
| 641 | Design Circular Deque | Medium | |
| 1331 | Rank Transform of an Array | Easy | |
| 619 | Biggest Single Number | Easy | |
| 774 | Minimize Max Distance to Gas Station | Hard | |
| 2491 | Divide Players Into Teams of Equal Skill | Medium | |
| 1813 | Sentence Similarity III | Medium | |
| 3019 | Number of Changing Keys | Easy | |
| 2696 | Minimum String Length After Removing Substrings | Easy | |
| 1541 | Minimum Insertions to Balance a Parentheses String | Medium | |
| 291 | Word Pattern II | Medium | |
| 2406 | Divide Intervals Into Minimum Number of Groups | Medium | |
| 866 | Prime Palindrome | Medium | |
| 490 | The Maze | Medium | |
| 710 | Random Pick with Blacklist | Hard | |
| 2530 | Maximal Score After Applying K Operations | Medium | |
| 967 | Numbers With Same Consecutive Differences | Medium | |
| 358 | Rearrange String k Distance Apart | Hard | |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | Medium | |
| 919 | Complete Binary Tree Inserter | Medium | |
| 1593 | Split a String Into the Max Number of Unique Substrings | Medium | |
| 1403 | Minimum Subsequence in Non-Increasing Order | Easy | |
| 440 | K-th Smallest in Lexicographical Order | Hard | |
| 2418 | Sort the People | Easy | |
| 3326 | Minimum Division Operations to Make Array Non Decreasing | Medium | |
| 1817 | Finding the Users Active Minutes | Medium | |
| 1549 | The Most Recent Orders for Each Product | Medium | |
| 635 | Design Log Storage System | Medium | |
| 3159 | Find Occurrences of an Element in an Array | Medium | |
| 2017 | Grid Game | Medium | |
| 2663 | Lexicographically Smallest Beautiful String | Hard | |
| 3011 | Find if Array Can Be Sorted | Medium | |
| 2275 | Largest Combination With Bitwise AND Greater Than Zero | Medium | |
| 2043 | Simple Bank System | Medium | |
| 2601 | Prime Subtraction Operation | Medium | |
| 2070 | Most Beautiful Item for Each Query | Medium | |
| 942 | DI String Match | Easy | |
| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | |
| 3264 | Final Array State After K Multiplication Operations I | Easy | |
| 2414 | Length of the Longest Alphabetical Continuous Substring | Medium | |
| 1780 | Check if Number is a Sum of Powers of Three | Medium | |
| 3349 | Adjacent Increasing Subarrays Detection I | Easy | |
| 505 | The Maze II | Medium | |
| 2516 | Take K of Each Character From Left and Right | Medium | |
| 1072 | Flip Columns For Maximum Number of Equal Rows | Medium | |
| 2889 | Reshape Data: Pivot | Easy | |
| 1898 | Maximum Number of Removable Characters | Medium | |
| 281 | Zigzag Iterator | Medium | |
| 1713 | Minimum Operations to Make a Subsequence | Hard | |
| 2577 | Minimum Time to Visit a Cell In a Grid | Hard | |
| 2097 | Valid Arrangement of Pairs | Hard | |
| 1596 | The Most Frequently Ordered Products for Each Customer | Medium | |
| 1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentence | Easy | |
| 1871 | Jump Game VII | Medium | |
| 2593 | Find Score of an Array After Marking All Elements | Medium | |
| 1139 | Largest 1-Bordered Square | Medium | |
| 3229 | Minimum Operations to Make Array Equal to Target | Hard | |
| 1748 | Sum of Unique Elements | Easy | |
| 2872 | Maximum Number of K-Divisible Components | Hard | |
| 2940 | Find Building Where Alice and Bob Can Meet | Hard | |
| 3077 | Maximum Strength of K Disjoint Subarrays | Hard | |
| 2211 | Count Collisions on a Road | Medium | |
| 3386 | Button with Longest Push Time | Easy | |
| 1270 | All People Report to the Given Manager | Medium | |
| 1014 | Best Sightseeing Pair | Medium | |
| 689 | Maximum Sum of 3 Non-Overlapping Subarrays | Hard | |
| 2466 | Count Ways To Build Good Strings | Medium | |
| 761 | Special Binary String | Hard | |
| 292 | Nim Game | Easy | |
| 2559 | Count Vowel Strings in Ranges | Medium | |
| 2381 | Shifting Letters II | Medium | |
| 2587 | Rearrange Array to Maximize Prefix Score | Medium | |
| 916 | Word Subsets | Medium | |
| 2789 | Largest Element in an Array after Merge Operations | Medium | |
| 690 | Employee Importance | Medium | |
| 1400 | Construct K Palindrome Strings | Medium | |
| 3223 | Minimum Length of String After Operations | Medium | |
| 1517 | Find Users With Valid E-Mails | Easy | |
| 2429 | Minimize XOR | Medium | |
| 2683 | Neighboring Bitwise XOR | Medium | |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | Hard | |
| 3429 | Paint House IV | Medium | |
| 1245 | Tree Diameter | Medium | |
| 1765 | Map of Highest Peak | Medium | |
| 2467 | Most Profitable Path in a Tree | Medium | |
| 1443 | Minimum Time to Collect All Apples in a Tree | Medium | |
| 1383 | Maximum Performance of a Team | Hard | |
| 2948 | Make Lexicographically Smallest Array by Swapping Elements | Medium | |
| 1856 | Maximum Subarray Min-Product | Medium | |
| 2317 | Maximum XOR After Operations | Medium | |
| 2658 | Maximum Number of Fish in a Grid | Medium | |
| 2517 | Maximum Tastiness of Candy Basket | Medium | |
| 944 | Delete Columns to Make Sorted | Easy | |
| 3309 | Maximum Possible Number by Binary Concatenation | Medium | |
| 1800 | Maximum Ascending Subarray Sum | Easy | |
| 353 | Design Snake Game | Medium | |
| 1609 | Even Odd Tree | Medium | |
| 2772 | Apply Operations to Make All Array Elements Equal to Zero | Medium | |
| 768 | Max Chunks To Make Sorted II | Hard | |
| 1726 | Tuple with Same Product | Medium | |
| 3160 | Find the Number of Distinct Colors Among the Balls | Medium | |
| 795 | Number of Subarrays with Bounded Maximum | Medium | |
| 2034 | Stock Price Fluctuation | Medium | |
| 3449 | Maximize the Minimum Game Score | Hard | |
| 2656 | Maximum Sum With Exactly K Elements | Easy | |
| 631 | Design Excel Sum Formula | Hard | |
| 3026 | Maximum Good Subarray Sum | Medium | |
| 3066 | Minimum Operations to Exceed Threshold Value II | Medium | |
| 1036 | Escape a Large Maze | Hard | |
| 2492 | Minimum Score of a Path Between Two Cities | Medium | |
| 2698 | Find the Punishment Number of an Integer | Medium | |
| 1415 | The k-th Lexicographical String of All Happy Strings of Length n | Medium | |
| 370 | Range Addition | Medium | |
| 2319 | Check if Matrix Is X-Matrix | Easy | |
| 728 | Self Dividing Numbers | Easy | |
| 2493 | Divide Nodes Into the Maximum Number of Groups | Hard | |
| 3458 | Select K Disjoint Special Substrings | Medium | |
| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | Medium | |
| 1827 | Minimum Operations to Make the Array Increasing | Easy | |
| 250 | Count Univalue Subtrees | Medium | |
| 1749 | Maximum Absolute Sum of Any Subarray | Medium | |
| 1524 | Number of Sub-arrays With Odd Sum | Medium | |
| 898 | Bitwise ORs of Subarrays | Medium | |
| 3454 | Separate Squares II | Hard | |
| 873 | Length of Longest Fibonacci Subsequence | Medium | |
| 657 | Robot Return to Origin | Easy | |
| 1366 | Rank Teams by Votes | Medium | |
| 147 | Insertion Sort List | Medium | |
| 737 | Sentence Similarity II | Medium | |
| 2579 | Count Total Number of Colored Cells | Medium | |
| 1559 | Detect Cycles in 2D Grid | Medium | |
| 2523 | Closest Prime Numbers in Range | Medium | |
| 2379 | Minimum Recolors to Get K Consecutive Black Blocks | Easy | |
| 773 | Sliding Puzzle | Hard | |
| 609 | Find Duplicate File in System | Medium | |
| 3356 | Zero Array Transformation II | Medium | |
| 589 | N-ary Tree Preorder Traversal | Easy | |
| 2594 | Minimum Time to Repair Cars | Medium | |
| 2206 | Divide Array Into Equal Pairs | Easy | |
| 1136 | Parallel Courses | Medium | |
| 2956 | Find Common Elements Between Two Arrays | Easy | |
| 352 | Data Stream as Disjoint Intervals | Hard | |
| 2062 | Count Vowel Substrings of a String | Easy | |
| 2484 | Count Palindromic Subsequences | Hard | |
| 1439 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | Hard | |
| 1200 | Minimum Absolute Difference | Easy | |
| 3169 | Count Days Without Meetings | Medium | |
| 3394 | Check if Grid can be Cut into Sections | Medium | |
| 2780 | Minimum Index of a Valid Split | Medium | |
| 3414 | Maximum Score of Non-overlapping Intervals | Hard | |
| 495 | Teemo Attacking | Easy | |
| 3306 | Count of Substrings Containing Every Vowel and K Consonants II | Medium | |
| 886 | Possible Bipartition | Medium | |
| 1262 | Greatest Sum Divisible by Three | Medium | |
| 1962 | Remove Stones to Minimize the Total | Medium | |
| 2874 | Maximum Value of an Ordered Triplet II | Medium | |
| 3230 | Customer Purchasing Behavior Analysis | Medium | |
| 1158 | Market Analysis I | Medium | |
| 3034 | Number of Subarrays That Match a Pattern I | Medium | |
| 3483 | Unique 3-Digit Even Numbers | Easy | |
| 563 | Binary Tree Tilt | Easy | |
| 1943 | Describe the Painting | Medium | |
| 984 | String Without AAA or BBB | Medium | |
| 2672 | Number of Adjacent Elements With the Same Color | Medium | |
| 3206 | Alternating Groups I | Easy | |
| 2426 | Number of Pairs Satisfying Inequality | Hard | |
| 488 | Zuma Game | Hard | |
| 2570 | Merge Two 2D Arrays by Summing Values | Easy | |
| 3050 | Pizza Toppings Cost Analysis | Medium | |
| 1865 | Finding Pairs With a Certain Sum | Medium | |
| 282 | Expression Add Operators | Hard | |
| 2338 | Count the Number of Ideal Arrays | Hard | |
| 2302 | Count Subarrays With Score Less Than K | Hard | |
| 1991 | Find the Middle Index in Array | Easy | |
| 401 | Binary Watch | Easy | |
| 2071 | Maximum Number of Tasks You Can Assign | Hard | |
| 838 | Push Dominoes | Medium | |
| 1007 | Minimum Domino Rotations For Equal Row | Medium | |
| 308 | Range Sum Query 2D - Mutable | Medium | |
| 2291 | Maximum Profit From Trading Stocks | Medium | |
| 3342 | Find Minimum Time to Reach Last Room II | Medium | |
| 2918 | Minimum Equal Sum of Two Arrays After Replacing Zeros | Medium | |
| 1864 | Minimum Number of Swaps to Make the Binary String Alternating | Medium | |
| 3335 | Total Characters in String After Transformations I | Medium | |
| 3273 | Minimum Amount of Damage Dealt to Bob | Hard | |
| 1931 | Painting a Grid With Three Different Colors | Hard | |
| 434 | Number of Segments in a String | Easy | |
| 3355 | Zero Array Transformation I | Medium | |
| 2481 | Minimum Cuts to Divide a Circle | Easy | |
| 3426 | Manhattan Distances of All Arrangements of Pieces | Hard | |
| 2550 | Count Collisions of Monkeys on a Polygon | Medium | |
| 3424 | Minimum Cost to Make Arrays Identical | Medium | |
| 2894 | Divisible and Non-divisible Sums Difference | Easy | |
| 397 | Integer Replacement | Medium | |
| 2815 | Max Pair Sum in an Array | Easy | |
| 1691 | Maximum Height by Stacking Cuboids | Hard | |
| 2359 | Find Closest Node to Given Two Nodes | Medium | |
| 1240 | Tiling a Rectangle with the Fewest Squares | Hard | |
| 1061 | Lexicographically Smallest Equivalent String | Medium | |
| 3403 | Find the Lexicographically Largest String From the Box I | Medium | |
| 3388 | Count Beautiful Splits in an Array | Medium | |
| 298 | Binary Tree Longest Consecutive Sequence | Medium | |
| 2873 | Maximum Value of an Ordered Triplet I | Easy | |
| 637 | Average of Levels in Binary Tree | Easy | |
| 3442 | Maximum Difference Between Even and Odd Frequency I | Easy | |
| 3362 | Zero Array Transformation III | Medium | |
| 3445 | Maximum Difference Between Even and Odd Frequency II | Hard | |
| 3423 | Maximum Difference Between Adjacent Elements in a Circular Array | Easy | |
| 1432 | Max Difference You Can Get From Changing an Integer | Medium | |
| 2016 | Maximum Difference Between Increasing Elements | Easy | |
| 3214 | Year on Year Growth Rate | Hard | |
| 3405 | Count the Number of Arrays with K Matching Adjacent Elements | Hard | |
| 892 | Surface Area of 3D Shapes | Easy | |
| 1941 | Check if All Characters Have Equal Number of Occurrences | Easy | |
| 2200 | Find All K-Distant Indices in an Array | Easy | |
| 1893 | Check if All the Integers in a Range Are Covered | Easy | |
| 2427 | Number of Common Factors | Easy | |
| 2040 | Kth Smallest Product of Two Sorted Arrays | Hard | |
| 1198 | Find Smallest Common Element in All Rows | Medium | |
| 2265 | Count Nodes Equal to Average of Subtree | Medium | |
| 2500 | Delete Greatest Value in Each Row | Easy | |
| 2311 | Longest Binary Subsequence Less Than or Equal to K | Medium | |
| 783 | Minimum Distance Between BST Nodes | Easy | |
| 2014 | Longest Subsequence Repeated k Times | Hard | |
| 1928 | Minimum Cost to Reach Destination in Time | Hard | |
| 2187 | Minimum Time to Complete Trips | Medium | |
| 3330 | Find the Original Typed String I | Easy | |
| 3333 | Find the Original Typed String II | Hard | |
| 1763 | Longest Nice Substring | Easy | |
| 3307 | Find the K-th Character in String Game II | Hard | |
| 3598 | Longest Common Prefix Between Adjacent Strings After Removals | Medium | |
| 1217 | Minimum Cost to Move Chips to The Same Position | Easy | |
| 821 | Shortest Distance to a Character | Easy | |
| 3439 | Reschedule Meetings for Maximum Free Time I | Medium | |
| 305 | Number of Islands II | Hard | |
| 1643 | Kth Smallest Instructions | Hard | |
| 3440 | Reschedule Meetings for Maximum Free Time II | Medium | |
| 858 | Mirror Reflection | Medium | |
| 1900 | The Earliest and Latest Rounds Where Players Compete | Hard | |
| 2001 | Number of Pairs of Interchangeable Rectangles | Medium | |
| 2779 | Maximum Beauty of an Array After Applying Operation | Medium | |
| 741 | Cherry Pickup | Hard | |
| 1667 | Fix Names in a Table | Easy | |
| 2571 | Minimum Operations to Reduce an Integer to 0 | Medium | |
| 924 | Minimize Malware Spread | Hard | |
| 3456 | Find Special Substring of Length K | Easy | |
| 512 | Game Play Analysis II | Easy | |
| 492 | Construct the Rectangle | Easy | |
| 1957 | Delete Characters to Make Fancy String | Easy | |
| 1970 | Last Day Where You Can Still Cross | Hard | |
| 2596 | Check Knight Tour Configuration | Medium | |
| 3507 | Minimum Pair Removal to Sort Array I | Easy | |
| 3487 | Maximum Unique Subarray Sum After Deletion | Easy | |
| 1306 | Jump Game III | Medium | |
| 3340 | Check Balanced String | Easy | |
| 2210 | Count Hills and Valleys in an Array | Easy | |
| 3480 | Maximize Subarrays After Removing One Conflicting Pair | Hard | |
| 2771 | Longest Non-decreasing Subarray From Two Arrays | Medium | |
| 1610 | Maximum Number of Visible Points | Hard | |
| 2119 | A Number After a Double Reversal | Easy | |
| 3357 | Minimize the Maximum Adjacent Element Difference | Hard | |
| 559 | Maximum Depth of N-ary Tree | Easy | |
| 2561 | Rearranging Fruits | Hard | |
| 2106 | Maximum Fruits Harvested After at Most K Steps | Hard | |
| 3638 | Maximum Balanced Shipments | Medium | |
| 285 | Inorder Successor in BST | Medium | |
| 3002 | Maximum Size of a Set After Removals | Medium | |
| 3477 | Fruits Into Baskets II | Easy | |
| 1527 | Patients With a Condition | Easy | |
| 3479 | Fruits Into Baskets III | Medium | |
| 2566 | Maximum Difference by Remapping a Digit | Easy | |
| 2438 | Range Product Queries of Powers | Medium | |
| 223 | Rectangle Area | Medium | |
| 2787 | Ways to Express an Integer as Sum of Powers | Medium | |
| 3482 | Analyze Organization Hierarchy | Hard | |
| 3542 | Minimum Operations to Convert All Elements to Zero | Medium | |
| 1370 | Increasing Decreasing String | Easy | |
| 473 | Matchsticks to Square | Medium | |
| 3438 | Find Valid Pair of Adjacent Digits in String | Easy | |
| 1394 | Find Lucky Integer in an Array | Easy | |
| 2735 | Collecting Chocolates | Medium | |
| 940 | Distinct Subsequences II | Hard | |
| 1504 | Count Submatrices With All Ones | Medium | |
| 3195 | Find the Minimum Area to Cover All Ones I | Medium | |
| 1861 | Rotating the Box | Medium | |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | Hard | |
| 1907 | Count Salary Categories | Medium | |
| 3446 | Sort Matrix by Diagonals | Medium | |
| 1836 | Remove Duplicates From an Unsorted Linked List | Medium | |
| 3021 | Alice and Bob Playing Flower Game | Medium | |
| 3669 | Balanced K-Factor Decomposition | Medium | |
| 1266 | Minimum Time Visiting All Points | Easy | |
| 3666 | Minimum Operations to Equalize Binary String | Hard | |
| 546 | Remove Boxes | Hard | |
| 3025 | Find the Number of Ways to Place People I | Medium | |
| 1297 | Maximum Number of Occurrences of a Substring | Medium | |
| 3516 | Find Closest Person | Easy | |
| 3260 | Find the Largest Palindrome Divisible by K | Hard | |
| 2749 | Minimum Operations to Make the Integer Zero | Medium | |
| 1317 | Convert Integer to the Sum of Two No-Zero Integers | Easy | |
| 2890 | Reshape Data: Melt | Easy | |
| 2327 | Number of People Aware of a Secret | Medium | |
| 2545 | Sort the Students by Their Kth Score | Medium | |
| 1733 | Minimum Number of People to Teach | Medium | |
| 3541 | Find Most Frequent Vowel and Consonant | Easy | |
| 966 | Vowel Spellchecker | Medium | |
| 1935 | Maximum Number of Words You Can Type | Easy | |
| 3408 | Design Task Manager | Medium | |
| 929 | Unique Email Addresses | Easy | |
| 1201 | Ugly Number III | Medium | |
| 2114 | Maximum Number of Words Found in Sentences | Easy | |
| 2592 | Maximize Greatness of an Array | Medium | |
| 2544 | Alternating Digit Sum | Easy | |
| 2089 | Find Target Indices After Sorting Array | Easy | |
| 3100 | Water Bottles II | Medium | |
| 3297 | Count Substrings That Can Be Rearranged to Contain a String I | Medium | |
| 1203 | Sort Items by Groups Respecting Dependencies | Hard | |
| 3168 | Minimum Number of Chairs in a Waiting Room | Easy | |
| 3071 | Minimum Operations to Write the Letter Y on a Grid | Medium | |
| 825 | Friends Of Appropriate Ages | Medium | |
| 2320 | Count Number of Ways to Place Houses | Medium | |
| 1145 | Binary Tree Coloring Game | Medium | |
| 3494 | Find the Minimum Amount of Time to Brew Potions | Medium | |
| 3147 | Taking Maximum Energy From the Mystic Dungeon | Medium | |
| 3186 | Maximum Total Damage With Spell Casting | Medium | |
| 3664 | Two-Letter Card Game | Medium | |
| 444 | Sequence Reconstruction | Medium | |
| 1881 | Maximum Value after Insertion | Medium | |
| 2598 | Smallest Missing Non-negative Integer After Operations | Medium | |
| 1948 | Delete Duplicate Folders in System | Hard | |
| 3397 | Maximum Number of Distinct Elements After Operations | Medium | |
| 3720 | Lexicographically Smallest Permutation Greater Than Target | Medium | |
| 2389 | Longest Subsequence With Limited Sum | Easy | |
| 3347 | Maximum Frequency of an Element After Performing Operations II | Hard | |
| 3346 | Maximum Frequency of an Element After Performing Operations I | Medium | |
| 3715 | Sum of Perfect Square Ancestors | Hard | |
| 1446 | Consecutive Characters | Easy | |
| 491 | Non-decreasing Subsequences | Medium | |
| 3354 | Make Array Elements Equal to Zero | Easy | |
| 3728 | Stable Subarrays With Equal Boundary and Interior Sum | Medium | |
| 3370 | Smallest Number With All Set Bits | Easy | |
| 2421 | Number of Good Paths | Hard | |
| 3289 | The Two Sneaky Numbers of Digitville | Easy | |
| 3428 | Maximum and Minimum Sums of at Most Size K Subsequences | Medium | |
| 2257 | Count Unguarded Cells in the Grid | Medium | |
| 1578 | Minimum Time to Make Rope Colorful | Medium | |
| 3318 | Find X-Sum of All K-Long Subarrays I | Easy | |
| 3517 | Smallest Palindromic Rearrangement I | Medium | |
| 3573 | Best Time to Buy and Sell Stock V | Medium | |
| 3607 | Power Grid Maintenance | Medium | |
| 2528 | Maximize the Minimum Powered City | Hard | |
| 280 | Wiggle Sort | Medium | |
| 2169 | Count Operations to Obtain Zero | Easy | |
| 2654 | Minimum Number of Operations to Make All Array Elements Equal to 1 | Medium | |
| 3228 | Maximum Number of Operations to Move Ones to the End | Medium | |
| 411 | Minimum Unique Word Abbreviation | Hard | |
| 757 | Set Intersection Size At Least Two | Hard | |
| 3190 | Find Minimum Operations to Make All Elements Divisible by Three | Easy | |
| 3608 | Minimum Time for K Connected Components | Medium | |
| 1015 | Smallest Integer Divisible by K | Medium | |
| 2435 | Paths in Matrix Whose Sum Is Divisible by K | Hard | |
| 1776 | Car Fleet II | Hard | |
| 3381 | Maximum Subarray Sum With Length Divisible by K | Medium | |
| 2141 | Maximum Running Time of N Computers | Hard | |
| 1551 | Minimum Operations to Make Array Equal | Medium | |
| 3432 | Count Partitions with Even Sum Difference | Easy | |
| 3578 | Count Partitions With Max-Min Difference at Most K | Medium | |
| 1006 | Clumsy Factorial | Medium | |
| 3243 | Shortest Distance After Road Addition Queries I | Medium | |
| 1822 | Sign of the Product of an Array | Easy | |
| 3512 | Minimum Operations to Make Array Sum Divisible by K | Easy | |
| 2520 | Count the Digits That Divide a Number | Easy | |
| 3577 | Count the Number of Computer Unlocking Permutations | Medium | |
| 2562 | Find the Array Concatenation Value | Easy | |
| 1018 | Binary Prefix Divisible By 5 | Easy | |
| 1993 | Operations on Tree | Medium | |
| 1399 | Count Largest Group | Easy | |
| 3743 | Maximize Cyclic Partition Score | Hard | |
| 3508 | Implement Router | Medium | |
| 3652 | Best Time to Buy and Sell Stock using Strategy | Medium | |
| 2906 | Construct Product Matrix | Medium | |
| 955 | Delete Columns to Make Sorted II | Medium | |
| 598 | Range Addition II | Easy | |
| 256 | Paint House | Medium | |
| 2483 | Minimum Penalty for a Shop | Medium | |
| 1013 | Partition Array Into Three Parts With Equal Sum | Easy | |
| 474 | Ones and Zeroes | Medium | |
| 960 | Delete Columns to Make Sorted III | Hard | |
| 756 | Pyramid Transition Matrix | Medium | |
| 961 | N-Repeated Element in Size 2N Array | Easy | |
| 1411 | Number of Ways to Paint N × 3 Grid | Hard | |
| 1390 | Four Divisors | Medium | |
| 1380 | Lucky Numbers in a Matrix | Easy | |
| 311 | Sparse Matrix Multiplication | Medium | |
| 865 | Smallest Subtree with all the Deepest Nodes | Medium | |
| 1729 | Find Followers Count | Easy | |
| 391 | Perfect Rectangle | Hard | |
| 1743 | Restore the Array From Adjacent Pairs | Medium | |
| 2943 | Maximize Area of Square Hole in Grid | Medium | |
| 2007 | Find Original Array From Doubled Array | Medium | |
| 1513 | Number of Substrings With Only 1s | Medium | |
| 483 | Smallest Good Base | Hard | |
| 3314 | Construct the Minimum Bitwise Array I | Easy | |
| 3315 | Construct the Minimum Bitwise Array II | Medium | |
| 805 | Split Array With Same Average | Hard | |
| 2637 | Promise Time Limit | Medium | |
| 3510 | Minimum Pair Removal to Sort Array II | Hard | |
| 3780 | Maximum Sum of Three Numbers Divisible by Three | Medium | |
| 1877 | Minimize Maximum Pair Sum in Array | Medium | |
| 665 | Non-decreasing Array | Medium | |
| 1804 | Implement Trie II (Prefix Tree) | Medium | |
| 3650 | Minimum Cost Path with Edge Reversals | Medium | |
| 3651 | Minimum Cost Path with Teleportations | Hard | |
| 2513 | Minimize the Maximum of Two Arrays | Medium | |
| 1413 | Minimum Value to Get Positive Step by Step Sum | Easy | |
| 2843 | Count Symmetric Integers | Easy | |
| 2498 | Frog Jump II | Medium | |
| 3013 | Divide an Array Into Subarrays With Minimum Cost II | Hard | |
| 3484 | Design Spreadsheet | Medium | |
| 565 | Array Nesting | Medium | |
| 600 | Non-negative Integers without Consecutive Ones | Hard | |
| 3379 | Transformed Array | Easy | |
| 363 | Max Sum of Rectangle No Larger Than K | Hard | |
| 923 | 3Sum With Multiplicity | Medium | |
| 1979 | Find Greatest Common Divisor of Array | Easy | |
| 3227 | Vowels Game in a String | Medium | |
| 1895 | Largest Magic Square | Medium | |
| 2457 | Minimum Addition to Make Integer Beautiful | Medium | |
| 2383 | Minimum Hours of Training to Win a Competition | Easy | |
| 3028 | Ant on the Boundary | Easy | |
| 2503 | Maximum Number of Points From Grid Queries | Hard | |
| 3719 | Longest Balanced Subarray I | Medium | |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard | |
| 530 | Minimum Absolute Difference in BST | Easy | |
| 3721 | Longest Balanced Subarray II | Hard | |
| 3713 | Longest Balanced Substring I | Medium | |
| 3714 | Longest Balanced Substring II | Medium | |
| 3796 | Find Maximum Value in a Constrained Sequence | Medium | |
| 799 | Champagne Tower | Medium | |
| 804 | Unique Morse Code Words | Easy | |
| 687 | Longest Univalue Path | Medium | |
| 2808 | Minimum Seconds to Equalize a Circular Array | Medium | |
| 2860 | Happy Students | Medium | |
| 693 | Binary Number with Alternating Bits | Easy | |
| 988 | Smallest String Starting From Leaf | Medium | |
| 586 | Customer Placing the Largest Number of Orders | Easy | |
| 476 | Number Complement | Easy | |
| 868 | Binary Gap | Easy | |
| 1461 | Check If a String Contains All Binary Codes of Size K | Medium | |
| 2131 | Longest Palindrome by Concatenating Two Letter Words | Medium | |
| 990 | Satisfiability of Equality Equations | Medium | |
| 859 | Buddy Strings | Easy | |
| 2785 | Sort Vowels in a String | Medium | |
| 1536 | Minimum Swaps to Arrange a Binary Grid | Medium | |
| 2788 | Split Strings by Separator | Easy | |
| 1582 | Special Positions in a Binary Matrix | Easy | |
| 956 | Tallest Billboard | Hard | |
| 527 | Word Abbreviation | Hard | |
| 3521 | Find Product Recommendation Pairs | Medium | |
| 569 | Median Employee Salary | Hard | |
| 1758 | Minimum Changes To Make Alternating Binary String | Easy | |
| 1784 | Check if Binary String Has at Most One Segment of Ones | Easy | |
| 1888 | Minimum Number of Flips to Make the Binary String Alternating | Medium | |
| 1980 | Find Unique Binary String | Medium | |
| 1228 | Missing Number In Arithmetic Progression | Easy | |
| 3129 | Find All Possible Stable Binary Arrays I | Medium | |
| 3795 | Minimum Subarray Length With Distinct Sum At Least K | Medium | |
| 1932 | Merge BSTs to Create Single BST | Hard | |
| 3130 | Find All Possible Stable Binary Arrays II | Hard | |
| 1009 | Complement of Base 10 Integer | Easy | |
| 3600 | Maximize Spanning Tree Stability with Upgrades | Hard | |
| 3296 | Minimum Number of Seconds to Make Mountain Height Zero | Medium | |
| 3427 | Sum of Variable Length Subarrays | Easy | |
| 1622 | Fancy Sequence | Hard | |
| 1878 | Get Biggest Three Rhombus Sums in a Grid | Medium | |
| 1953 | Maximum Number of Weeks for Which You Can Work | Medium | |
| 1727 | Largest Submatrix With Rearrangements | Medium | |
| 2568 | Minimum Impossible OR | Medium | |
| 3567 | Minimum Absolute Difference in Sliding Submatrix | Medium | |
| 3552 | Grid Teleportation Traversal | Medium | |
| 1594 | Maximum Non Negative Product in a Matrix | Medium | |
| 1693 | Daily Leads and Partners | Easy | |
| 855 | Exam Room | Medium | |
| 1711 | Count Good Meals | Medium | |
| 3546 | Equal Sum Grid Partition I | Medium | |
| 3212 | Count Submatrices With Equal Frequency of X and Y | Medium | |
| 1912 | Design Movie Rental System | Hard | |
| 2946 | Matrix Similarity After Cyclic Shifts | Easy | |
| 2723 | Add Two Promises | Easy | |
| 2840 | Check if Strings Can be Made Equal With Operations II | Medium | |
| 3474 | Lexicographically Smallest Generated String | Hard | |
| 3418 | Maximum Amount of Money Robot Can Earn | Medium | |
| 877 | Stone Game | Medium | |
| 3661 | Maximum Walls Destroyed by Robots | Hard | |
| 3828 | Final Element After Subarray Deletions | Medium | |
| 2039 | The Time When the Network Becomes Idle | Medium | |
| 1236 | Web Crawler | Medium | |
| 3069 | Distribute Elements Into Two Arrays I | Easy | |
| 3653 | XOR After Range Multiplication Queries I | Medium | |
| 3655 | XOR After Range Multiplication Queries II | Hard | |
| 3740 | Minimum Distance Between Three Equal Elements I | Easy | |
| 2384 | Largest Palindromic Number | Medium | |
| 3741 | Minimum Distance Between Three Equal Elements II | Medium | |
| 2344 | Minimum Deletions to Make Array Divisible | Hard | |
| 3493 | Properties Graph | Medium | |
| 3266 | Final Array State After K Multiplication Operations II | Hard | |
| 2448 | Minimum Cost to Make Array Equal | Hard | |
| 501 | Find Mode in Binary Search Tree | Easy | |
| 917 | Reverse Only Letters | Easy | |
| 2463 | Minimum Total Distance Traveled | Hard | |
| 2024 | Maximize the Confusion of an Exam | Medium | |
| 2515 | Shortest Distance to Target String in a Circular Array | Easy | |
| 3488 | Closest Equal Element Queries | Medium | |
| 1281 | Subtract the Product and Sum of Digits of an Integer | Easy | |
| 3761 | Minimum Absolute Distance Between Mirror Pairs | Medium | |
| 2078 | Two Furthest Houses With Different Colors | Easy | |
| 1857 | Largest Color Value in a Directed Graph | Hard | |
| 2452 | Words Within Two Edits of Dictionary | Medium | |
| 2615 | Sum of Distances | Medium | |
| 1564 | Put Boxes Into the Warehouse I | Medium | |
| 2033 | Minimum Operations to Make a Uni-Value Grid | Medium | |
| 2470 | Number of Subarrays With LCM Equal to K | Medium | |
| 3225 | Maximum Score From Grid Operations | Hard | |
| 3857 | Minimum Cost to Split into Ones | Medium | |
| 2661 | First Completely Painted Row or Column | Medium | |
| 861 | Score After Flipping Matrix | Medium | |
| 1696 | Jump Game VI | Medium | |
| 1206 | Design Skiplist | Hard | |
| 3660 | Jump Game IX | Medium | |
| 3629 | Minimum Jumps to Reach End via Prime Teleportation | Medium | |
| 1914 | Cyclically Rotating a Grid | Medium | |
| 2770 | Maximum Number of Jumps to Reach the Last Index | Medium | |
| 1665 | Minimum Initial Energy to Finish Tasks | Hard | |
| 1674 | Minimum Moves to Make Array Complementary | Medium | |
| 3928 | Minimum Cost to Buy Apples II | Hard | |
| 566 | Reshape the Matrix | Easy | |
| 1494 | Parallel Courses II | Hard | |
| 1151 | Minimum Swaps to Group All 1's Together | Medium | |
| 1340 | Jump Game V | Hard | |
| 969 | Pancake Sorting | Medium | |
| 2057 | Smallest Index With Equal Value | Easy | |
| 3093 | Longest Common Suffix Queries | Hard | |
| 1945 | Sum of Digits of String After Convert | Easy | |
| 2144 | Minimum Cost of Buying Candies With Discount | Easy | |
| 975 | Odd Even Jump | Hard | |
| 2974 | Minimum Number Game | Easy | |
| 854 | K-Similar Strings | Hard | |
| 3633 | Earliest Finish Time for Land and Water Rides I | Easy | |
| 3635 | Earliest Finish Time for Land and Water Rides II | Medium | |
| 551 | Student Attendance Record I | Easy | |
| 3751 | Total Waviness of Numbers in Range I | Medium | |
| 3753 | Total Waviness of Numbers in Range II | Hard | |
| 2574 | Left and Right Sum Differences | Easy | |
| 2670 | Find the Distinct Difference Array | Easy | |
| 3689 | Maximum Total Subarray Value I | Medium | |
| 948 | Bag of Tokens | Medium | |
| 823 | Binary Trees With Factors | Medium | |
| 856 | Score of Parentheses | Medium | |
| 3691 | Maximum Total Subarray Value II | Hard | |
| 3558 | Number of Ways to Assign Edge Weights I | Medium | |
| 1978 | Employees Whose Manager Left the Company | Easy | |
| 1441 | Build an Array With Stack Operations | Medium | |
| 3412 | Find Mirror Score of a String | Medium | |
| 668 | Kth Smallest Number in Multiplication Table | Hard | |
| 3559 | Number of Ways to Assign Edge Weights II | Hard | |
| 3961 | Maximize Sum of Device Ratings | Medium | |
| 3469 | Find Minimum Cost to Remove Array Elements | Medium | |
| 3614 | Process String with Special Operations II | Hard | |
| 1840 | Maximum Building Height | Hard | |
| 1005 | Maximize Sum Of Array After K Negations | Easy | |
| 1189 | Maximum Number of Balloons | Easy | |
| 3699 | Number of ZigZag Arrays I | Hard | |
| 1987 | Number of Unique Good Subsequences | Hard | |
| 3700 | Number of ZigZag Arrays II | Hard | |
| 2603 | Collect Coins in a Tree | Hard | |
| 3737 | Count Subarrays With Majority Element I | Medium | |
| 914 | X of a Kind in a Deck of Cards | Easy | |
| 1972 | First and Last Call On the Same Day | Hard | |
| 3901 | Good Subsequence Queries | Hard | |
| 3000 | Maximum Area of Longest Diagonal Rectangle | Easy | |
| 3739 | Count Subarrays With Majority Element II | Hard | |
| 357 | Count Numbers with Unique Digits | Medium | |
| 1797 | Design Authentication Manager | Medium | |
| 1967 | Number of Strings That Appear as Substrings in Word | Easy | |
| 2812 | Find the Safest Path in a Grid | Medium | |
| 1703 | Minimum Adjacent Swaps for K Consecutive Ones | Hard | |
| 3620 | Network Recovery Pathways | Hard | |
| 639 | Decode Ways II | Hard | |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | |
| 1184 | Distance Between Bus Stops | Easy | |
| 1301 | Number of Paths with Max Score | Hard | |
| 1905 | Count Sub Islands | Medium | |
| 864 | Shortest Path to Get All Keys | Hard | |
| 2271 | Maximum White Tiles Covered by a Carpet | Medium | |
| 376 | Wiggle Subsequence | Medium | |
| 3756 | Concatenate Non-Zero Digits and Multiply by Sum II | Medium | |
| 818 | Race Car | Hard | |
| 3754 | Concatenate Non-Zero Digits and Multiply by Sum I | Easy | |
| 925 | Long Pressed Name | Easy | |
| 1537 | Get the Maximum Score | Hard | |
| 3532 | Path Existence Queries in a Graph I | Medium | |
| 2828 | Check if a String Is an Acronym of Words | Easy | |
| 2529 | Maximum Count of Positive Integer and Negative Integer | Easy | |
| 3534 | Path Existence Queries in a Graph II | Hard |
