All companies
Microsoft
392 Easy764 Medium230 Hard1386 total
| No. | Problem | Difficulty | Frequency |
|---|---|---|---|
| 1 | Two Sum | Easy | |
| 2 | Add Two Numbers | Medium | |
| 3 | Longest Substring Without Repeating Characters | Medium | |
| 4 | Median of Two Sorted Arrays | Hard | |
| 5 | Longest Palindromic Substring | Medium | |
| 9 | Palindrome Number | Easy | |
| 11 | Container With Most Water | Medium | |
| 13 | Roman to Integer | Easy | |
| 14 | Longest Common Prefix | Easy | |
| 15 | 3Sum | Medium | |
| 20 | Valid Parentheses | Easy | |
| 26 | Remove Duplicates from Sorted Array | Easy | |
| 33 | Search in Rotated Sorted Array | Medium | |
| 42 | Trapping Rain Water | Hard | |
| 49 | Group Anagrams | Medium | |
| 53 | Maximum Subarray | Medium | |
| 56 | Merge Intervals | Medium | |
| 88 | Merge Sorted Array | Easy | |
| 121 | Best Time to Buy and Sell Stock | Easy | |
| 146 | LRU Cache | Medium | |
| 169 | Majority Element | Easy | |
| 200 | Number of Islands | Medium | |
| 560 | Subarray Sum Equals K | Medium | |
| 7 | Reverse Integer | Medium | |
| 17 | Letter Combinations of a Phone Number | Medium | |
| 21 | Merge Two Sorted Lists | Easy | |
| 22 | Generate Parentheses | Medium | |
| 23 | Merge k Sorted Lists | Hard | |
| 25 | Reverse Nodes in k-Group | Hard | |
| 27 | Remove Element | Easy | |
| 28 | Find the Index of the First Occurrence in a String | Easy | |
| 31 | Next Permutation | Medium | |
| 35 | Search Insert Position | Easy | |
| 46 | Permutations | Medium | |
| 48 | Rotate Image | Medium | |
| 50 | Pow(x, n) | Medium | |
| 51 | N-Queens | Hard | |
| 54 | Spiral Matrix | Medium | |
| 55 | Jump Game | Medium | |
| 70 | Climbing Stairs | Easy | |
| 73 | Set Matrix Zeroes | Medium | |
| 75 | Sort Colors | Medium | |
| 79 | Word Search | Medium | |
| 125 | Valid Palindrome | Easy | |
| 128 | Longest Consecutive Sequence | Medium | |
| 138 | Copy List with Random Pointer | Medium | |
| 151 | Reverse Words in a String | Medium | |
| 155 | Min Stack | Medium | |
| 162 | Find Peak Element | Medium | |
| 189 | Rotate Array | Medium | |
| 198 | House Robber | Medium | |
| 206 | Reverse Linked List | Easy | |
| 215 | Kth Largest Element in an Array | Medium | |
| 217 | Contains Duplicate | Easy | |
| 238 | Product of Array Except Self | Medium | |
| 242 | Valid Anagram | Easy | |
| 253 | Meeting Rooms II | Medium | |
| 283 | Move Zeroes | Easy | |
| 297 | Serialize and Deserialize Binary Tree | Hard | |
| 540 | Single Element in a Sorted Array | Medium | |
| 875 | Koko Eating Bananas | Medium | |
| 1768 | Merge Strings Alternately | Easy | |
| 1757 | Recyclable and Low Fat Products | Easy | |
| 2667 | Create Hello World Function | Easy | |
| 6 | Zigzag Conversion | Medium | |
| 8 | String to Integer (atoi) | Medium | |
| 10 | Regular Expression Matching | Hard | |
| 12 | Integer to Roman | Medium | |
| 18 | 4Sum | Medium | |
| 19 | Remove Nth Node From End of List | Medium | |
| 24 | Swap Nodes in Pairs | Medium | |
| 29 | Divide Two Integers | Medium | |
| 32 | Longest Valid Parentheses | Hard | |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | |
| 36 | Valid Sudoku | Medium | |
| 37 | Sudoku Solver | Hard | |
| 39 | Combination Sum | Medium | |
| 41 | First Missing Positive | Hard | |
| 45 | Jump Game II | Medium | |
| 62 | Unique Paths | Medium | |
| 64 | Minimum Path Sum | Medium | |
| 66 | Plus One | Easy | |
| 67 | Add Binary | Easy | |
| 69 | Sqrt(x) | Easy | |
| 71 | Simplify Path | Medium | |
| 72 | Edit Distance | Medium | |
| 74 | Search a 2D Matrix | Medium | |
| 76 | Minimum Window Substring | Hard | |
| 78 | Subsets | Medium | |
| 84 | Largest Rectangle in Histogram | Hard | |
| 85 | Maximal Rectangle | Hard | |
| 91 | Decode Ways | Medium | |
| 93 | Restore IP Addresses | Medium | |
| 94 | Binary Tree Inorder Traversal | Easy | |
| 98 | Validate Binary Search Tree | Medium | |
| 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 | |
| 114 | Flatten Binary Tree to Linked List | Medium | |
| 116 | Populating Next Right Pointers in Each Node | Medium | |
| 118 | Pascal's Triangle | Easy | |
| 122 | Best Time to Buy and Sell Stock II | Medium | |
| 124 | Binary Tree Maximum Path Sum | Hard | |
| 127 | Word Ladder | Hard | |
| 131 | Palindrome Partitioning | Medium | |
| 134 | Gas Station | Medium | |
| 135 | Candy | Hard | |
| 136 | Single Number | Easy | |
| 139 | Word Break | Medium | |
| 141 | Linked List Cycle | Easy | |
| 142 | Linked List Cycle II | Medium | |
| 143 | Reorder List | 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 | |
| 168 | Excel Sheet Column Title | Easy | |
| 171 | Excel Sheet Column Number | Easy | |
| 175 | Combine Two Tables | Easy | |
| 179 | Largest Number | Medium | |
| 197 | Rising Temperature | Easy | |
| 202 | Happy Number | Easy | |
| 204 | Count Primes | Medium | |
| 205 | Isomorphic Strings | Easy | |
| 207 | Course Schedule | Medium | |
| 208 | Implement Trie (Prefix Tree) | Medium | |
| 209 | Minimum Size Subarray Sum | Medium | |
| 210 | Course Schedule II | Medium | |
| 212 | Word Search II | Hard | |
| 213 | House Robber II | Medium | |
| 219 | Contains Duplicate II | Easy | |
| 224 | Basic Calculator | Hard | |
| 232 | Implement Queue using Stacks | Easy | |
| 234 | Palindrome Linked List | Easy | |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Medium | |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | |
| 237 | Delete Node in a Linked List | Medium | |
| 239 | Sliding Window Maximum | Hard | |
| 258 | Add Digits | Easy | |
| 268 | Missing Number | Easy | |
| 273 | Integer to English Words | Hard | |
| 287 | Find the Duplicate Number | Medium | |
| 295 | Find Median from Data Stream | Hard | |
| 300 | Longest Increasing Subsequence | Medium | |
| 322 | Coin Change | Medium | |
| 347 | Top K Frequent Elements | Medium | |
| 348 | Design Tic-Tac-Toe | Medium | |
| 349 | Intersection of Two Arrays | Easy | |
| 380 | Insert Delete GetRandom O(1) | Medium | |
| 387 | First Unique Character in a String | Easy | |
| 394 | Decode String | Medium | |
| 410 | Split Array Largest Sum | Hard | |
| 424 | Longest Repeating Character Replacement | Medium | |
| 443 | String Compression | Medium | |
| 460 | LFU Cache | Hard | |
| 496 | Next Greater Element I | Easy | |
| 503 | Next Greater Element II | Medium | |
| 567 | Permutation in String | Medium | |
| 621 | Task Scheduler | Medium | |
| 739 | Daily Temperatures | Medium | |
| 704 | Binary Search | Easy | |
| 863 | All Nodes Distance K in Binary Tree | Medium | |
| 876 | Middle of the Linked List | Easy | |
| 901 | Online Stock Span | Medium | |
| 509 | Fibonacci Number | Easy | |
| 994 | Rotting Oranges | Medium | |
| 1004 | Max Consecutive Ones III | Medium | |
| 1143 | Longest Common Subsequence | Medium | |
| 1475 | Final Prices With a Special Discount in a Shop | Easy | |
| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | |
| 1838 | Frequency of the Most Frequent Element | Medium | |
| 2246 | Longest Path With Different Adjacent Characters | Hard | |
| 2235 | Add Two Integers | Easy | |
| 383 | Ransom Note | Easy | |
| 485 | Max Consecutive Ones | Easy | |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard | |
| 1797 | Design Authentication Manager | Medium | |
| 16 | 3Sum Closest | Medium | |
| 40 | Combination Sum II | Medium | |
| 43 | Multiply Strings | Medium | |
| 44 | Wildcard Matching | Hard | |
| 47 | Permutations II | Medium | |
| 57 | Insert Interval | Medium | |
| 58 | Length of Last Word | Easy | |
| 59 | Spiral Matrix II | Medium | |
| 61 | Rotate List | Medium | |
| 68 | Text Justification | Hard | |
| 80 | Remove Duplicates from Sorted Array II | Medium | |
| 81 | Search in Rotated Sorted Array II | Medium | |
| 83 | Remove Duplicates from Sorted List | Easy | |
| 90 | Subsets II | Medium | |
| 92 | Reverse Linked List II | Medium | |
| 97 | Interleaving String | Medium | |
| 99 | Recover Binary Search Tree | Medium | |
| 100 | Same Tree | Easy | |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | Medium | |
| 108 | Convert Sorted Array to Binary Search Tree | Easy | |
| 110 | Balanced Binary Tree | Easy | |
| 112 | Path Sum | Easy | |
| 113 | Path Sum II | Medium | |
| 115 | Distinct Subsequences | Hard | |
| 117 | Populating Next Right Pointers in Each Node II | Medium | |
| 120 | Triangle | Medium | |
| 123 | Best Time to Buy and Sell Stock III | Hard | |
| 130 | Surrounded Regions | Medium | |
| 137 | Single Number II | Medium | |
| 148 | Sort List | Medium | |
| 150 | Evaluate Reverse Polish Notation | Medium | |
| 165 | Compare Version Numbers | Medium | |
| 173 | Binary Search Tree Iterator | Medium | |
| 174 | Dungeon Game | Hard | |
| 176 | Second Highest Salary | Medium | |
| 181 | Employees Earning More Than Their Managers | Easy | |
| 186 | Reverse Words in a String II | Medium | |
| 191 | Number of 1 Bits | Easy | |
| 199 | Binary Tree Right Side View | Medium | |
| 214 | Shortest Palindrome | Hard | |
| 218 | The Skyline Problem | Hard | |
| 225 | Implement Stack using Queues | Easy | |
| 227 | Basic Calculator II | Medium | |
| 229 | Majority Element II | Medium | |
| 230 | Kth Smallest Element in a BST | Medium | |
| 240 | Search a 2D Matrix II | Medium | |
| 274 | H-Index | Medium | |
| 279 | Perfect Squares | Medium | |
| 312 | Burst Balloons | Hard | |
| 316 | Remove Duplicate Letters | Medium | |
| 328 | Odd Even Linked List | Medium | |
| 344 | Reverse String | Easy | |
| 345 | Reverse Vowels of a String | Easy | |
| 365 | Water and Jug Problem | Medium | |
| 392 | Is Subsequence | Easy | |
| 402 | Remove K Digits | Medium | |
| 412 | Fizz Buzz | Easy | |
| 416 | Partition Equal Subset Sum | Medium | |
| 419 | Battleships in a Board | Medium | |
| 438 | Find All Anagrams in a String | Medium | |
| 445 | Add Two Numbers II | Medium | |
| 451 | Sort Characters By Frequency | Medium | |
| 452 | Minimum Number of Arrows to Burst Balloons | Medium | |
| 455 | Assign Cookies | Easy | |
| 493 | Reverse Pairs | Hard | |
| 494 | Target Sum | Medium | |
| 513 | Find Bottom Left Tree Value | Medium | |
| 543 | Diameter of Binary Tree | Easy | |
| 570 | Managers with at Least 5 Direct Reports | Medium | |
| 584 | Find Customer Referee | Easy | |
| 595 | Big Countries | Easy | |
| 605 | Can Place Flowers | Easy | |
| 642 | Design Search Autocomplete System | Hard | |
| 643 | Maximum Average Subarray I | Easy | |
| 645 | Set Mismatch | Easy | |
| 647 | Palindromic Substrings | Medium | |
| 650 | 2 Keys Keyboard | Medium | |
| 651 | 4 Keys Keyboard | Medium | |
| 653 | Two Sum IV - Input is a BST | Easy | |
| 658 | Find K Closest Elements | Medium | |
| 672 | Bulb Switcher II | Medium | |
| 680 | Valid Palindrome II | Easy | |
| 721 | Accounts Merge | Medium | |
| 722 | Remove Comments | Medium | |
| 733 | Flood Fill | Easy | |
| 735 | Asteroid Collision | Medium | |
| 767 | Reorganize String | Medium | |
| 772 | Basic Calculator III | Hard | |
| 794 | Valid Tic-Tac-Toe State | Medium | |
| 796 | Rotate String | Easy | |
| 706 | Design HashMap | Easy | |
| 805 | Split Array With Same Average | Hard | |
| 852 | Peak Index in a Mountain Array | Medium | |
| 871 | Minimum Number of Refueling Stops | Hard | |
| 886 | Possible Bipartition | Medium | |
| 907 | Sum of Subarray Minimums | Medium | |
| 912 | Sort an Array | Medium | |
| 987 | Vertical Order Traversal of a Binary Tree | Hard | |
| 992 | Subarrays with K Different Integers | Hard | |
| 1006 | Clumsy Factorial | Medium | |
| 1011 | Capacity To Ship Packages Within D Days | Medium | |
| 1019 | Next Greater Node In Linked List | Medium | |
| 1027 | Longest Arithmetic Subsequence | Medium | |
| 1071 | Greatest Common Divisor of Strings | Easy | |
| 1068 | Product Sales Analysis I | Easy | |
| 1092 | Shortest Common Supersequence | Hard | |
| 1114 | Print in Order | Easy | |
| 1148 | Article Views I | Easy | |
| 1193 | Monthly Transactions I | Medium | |
| 1235 | Maximum Profit in Job Scheduling | Hard | |
| 1251 | Average Selling Price | Easy | |
| 1280 | Students and Examinations | Easy | |
| 1285 | Find the Start and End Number of Continuous Ranges | Medium | |
| 1304 | Find N Unique Integers Sum up to Zero | Easy | |
| 1306 | Jump Game III | Medium | |
| 1318 | Minimum Flips to Make a OR b Equal to c | Medium | |
| 1344 | Angle Between Hands of a Clock | Medium | |
| 1324 | Print Words Vertically | Medium | |
| 1339 | Maximum Product of Splitted Binary Tree | Medium | |
| 1371 | Find the Longest Substring Containing Vowels in Even Counts | Medium | |
| 1386 | Cinema Seat Allocation | Medium | |
| 1375 | Number of Times Binary String Is Prefix-Aligned | Medium | |
| 1378 | Replace Employee ID With The Unique Identifier | Easy | |
| 1394 | Find Lucky Integer in an Array | Easy | |
| 1415 | The k-th Lexicographical String of All Happy Strings of Length n | Medium | |
| 1423 | Maximum Points You Can Obtain from Cards | Medium | |
| 1448 | Count Good Nodes in Binary Tree | Medium | |
| 1470 | Shuffle the Array | Easy | |
| 1480 | Running Sum of 1d Array | Easy | |
| 1482 | Minimum Number of Days to Make m Bouquets | Medium | |
| 1510 | Stone Game IV | Hard | |
| 1523 | Count Odd Numbers in an Interval Range | Easy | |
| 1518 | Water Bottles | Easy | |
| 1539 | Kth Missing Positive Number | Easy | |
| 1528 | Shuffle String | Easy | |
| 1578 | Minimum Time to Make Rope Colorful | Medium | |
| 1581 | Customer Who Visited but Did Not Make Any Transactions | Easy | |
| 1615 | Maximal Network Rank | Medium | |
| 1637 | Widest Vertical Area Between Two Points Containing No Points | Easy | |
| 1653 | Minimum Deletions to Make String Balanced | Medium | |
| 1671 | Minimum Number of Removals to Make Mountain Array | Hard | |
| 1647 | Minimum Deletions to Make Character Frequencies Unique | Medium | |
| 1650 | Lowest Common Ancestor of a Binary Tree III | Medium | |
| 1661 | Average Time of Process per Machine | Easy | |
| 1700 | Number of Students Unable to Eat Lunch | Easy | |
| 1703 | Minimum Adjacent Swaps for K Consecutive Ones | Hard | |
| 1763 | Longest Nice Substring | Easy | |
| 1752 | Check if Array Is Sorted and Rotated | Easy | |
| 1791 | Find Center of Star Graph | Easy | |
| 1836 | Remove Duplicates From an Unsorted Linked List | Medium | |
| 1854 | Maximum Population Year | Easy | |
| 1887 | Reduction Operations to Make the Array Elements Equal | Medium | |
| 1929 | Concatenation of Array | Easy | |
| 1945 | Sum of Digits of String After Convert | Easy | |
| 2028 | Find Missing Observations | Medium | |
| 2127 | Maximum Employees to Be Invited to a Meeting | Hard | |
| 2107 | Number of Unique Flavors After Sharing K Candies | Medium | |
| 2181 | Merge Nodes in Between Zeros | Medium | |
| 2206 | Divide Array Into Equal Pairs | Easy | |
| 2259 | Remove Digit From Number to Maximize Result | Easy | |
| 2384 | Largest Palindromic Number | Medium | |
| 2405 | Optimal Partition of String | Medium | |
| 2477 | Minimum Fuel Cost to Report to the Capital | Medium | |
| 2502 | Design Memory Allocator | Medium | |
| 2540 | Minimum Common Value | Easy | |
| 2664 | The Knight’s Tour | Medium | |
| 2815 | Max Pair Sum in an Array | Easy | |
| 2877 | Create a DataFrame from List | Easy | |
| 3040 | Maximum Number of Operations With the Same Score II | Medium | |
| 3139 | Minimum Cost to Equalize Array | Hard | |
| 3119 | Maximum Number of Potholes That Can Be Fixed | Medium | |
| 827 | Making A Large Island | Hard | |
| 577 | Employee Bonus | Easy | |
| 547 | Number of Provinces | Medium | |
| 221 | Maximal Square | Medium | |
| 1922 | Count Good Numbers | Medium | |
| 334 | Increasing Triplet Subsequence | Medium | |
| 3377 | Digit Operations to Make Two Integers Equal | Medium | |
| 498 | Diagonal Traverse | Medium | |
| 1358 | Number of Substrings Containing All Three Characters | Medium | |
| 696 | Count Binary Substrings | Easy | |
| 622 | Design Circular Queue | Medium | |
| 2571 | Minimum Operations to Reduce an Integer to 0 | Medium | |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | |
| 2484 | Count Palindromic Subsequences | Hard | |
| 3136 | Valid Word | Easy | |
| 761 | Special Binary String | Hard | |
| 1335 | Minimum Difficulty of a Job Schedule | Hard | |
| 516 | Longest Palindromic Subsequence | Medium | |
| 30 | Substring with Concatenation of All Words | Hard | |
| 38 | Count and Say | Medium | |
| 52 | N-Queens II | Hard | |
| 63 | Unique Paths II | Medium | |
| 77 | Combinations | Medium | |
| 82 | Remove Duplicates from Sorted List II | Medium | |
| 86 | Partition List | Medium | |
| 111 | Minimum Depth of Binary Tree | Easy | |
| 119 | Pascal's Triangle II | Easy | |
| 126 | Word Ladder II | Hard | |
| 129 | Sum Root to Leaf Numbers | Medium | |
| 133 | Clone Graph | Medium | |
| 140 | Word Break II | Hard | |
| 144 | Binary Tree Preorder Traversal | Easy | |
| 149 | Max Points on a Line | Hard | |
| 154 | Find Minimum in Rotated Sorted Array II | Hard | |
| 172 | Factorial Trailing Zeroes | Medium | |
| 178 | Rank Scores | Medium | |
| 180 | Consecutive Numbers | Medium | |
| 184 | Department Highest Salary | Medium | |
| 185 | Department Top Three Salaries | Hard | |
| 187 | Repeated DNA Sequences | Medium | |
| 188 | Best Time to Buy and Sell Stock IV | Hard | |
| 203 | Remove Linked List Elements | Easy | |
| 211 | Design Add and Search Words Data Structure | Medium | |
| 222 | Count Complete Tree Nodes | Easy | |
| 223 | Rectangle Area | Medium | |
| 226 | Invert Binary Tree | Easy | |
| 231 | Power of Two | Easy | |
| 233 | Number of Digit One | Hard | |
| 252 | Meeting Rooms | Easy | |
| 264 | Ugly Number II | Medium | |
| 269 | Alien Dictionary | Hard | |
| 270 | Closest Binary Search Tree Value | Easy | |
| 271 | Encode and Decode Strings | Medium | |
| 277 | Find the Celebrity | Medium | |
| 278 | First Bad Version | Easy | |
| 285 | Inorder Successor in BST | Medium | |
| 289 | Game of Life | Medium | |
| 290 | Word Pattern | Easy | |
| 292 | Nim Game | Easy | |
| 303 | Range Sum Query - Immutable | Easy | |
| 314 | Binary Tree Vertical Order Traversal | Medium | |
| 315 | Count of Smaller Numbers After Self | Hard | |
| 326 | Power of Three | Easy | |
| 329 | Longest Increasing Path in a Matrix | Hard | |
| 333 | Largest BST Subtree | Medium | |
| 337 | House Robber III | Medium | |
| 338 | Counting Bits | Easy | |
| 340 | Longest Substring with At Most K Distinct Characters | Medium | |
| 350 | Intersection of Two Arrays II | Easy | |
| 354 | Russian Doll Envelopes | Hard | |
| 355 | Design Twitter | Medium | |
| 362 | Design Hit Counter | Medium | |
| 367 | Valid Perfect Square | Easy | |
| 368 | Largest Divisible Subset | Medium | |
| 371 | Sum of Two Integers | Medium | |
| 373 | Find K Pairs with Smallest Sums | Medium | |
| 378 | Kth Smallest Element in a Sorted Matrix | Medium | |
| 395 | Longest Substring with At Least K Repeating Characters | Medium | |
| 399 | Evaluate Division | Medium | |
| 403 | Frog Jump | Hard | |
| 407 | Trapping Rain Water II | Hard | |
| 409 | Longest Palindrome | Easy | |
| 415 | Add Strings | Easy | |
| 432 | All O`one Data Structure | Hard | |
| 435 | Non-overlapping Intervals | Medium | |
| 437 | Path Sum III | Medium | |
| 441 | Arranging Coins | Easy | |
| 442 | Find All Duplicates in an Array | Medium | |
| 450 | Delete Node in a BST | Medium | |
| 463 | Island Perimeter | Easy | |
| 468 | Validate IP Address | Medium | |
| 475 | Heaters | Medium | |
| 502 | IPO | Hard | |
| 518 | Coin Change II | Medium | |
| 1983 | Widest Pair of Indices With Equal Range Sum | Medium | |
| 523 | Continuous Subarray Sum | Medium | |
| 525 | Contiguous Array | Medium | |
| 539 | Minimum Time Difference | Medium | |
| 542 | 01 Matrix | Medium | |
| 545 | Boundary of Binary Tree | Medium | |
| 556 | Next Greater Element III | Medium | |
| 564 | Find the Closest Palindrome | Hard | |
| 572 | Subtree of Another Tree | Easy | |
| 581 | Shortest Unsorted Continuous Subarray | Medium | |
| 588 | Design In-Memory File System | Hard | |
| 591 | Tag Validator | Hard | |
| 596 | Classes With at Least 5 Students | Easy | |
| 626 | Exchange Seats | Medium | |
| 631 | Design Excel Sum Formula | Hard | |
| 654 | Maximum Binary Tree | Medium | |
| 657 | Robot Return to Origin | Easy | |
| 678 | Valid Parenthesis String | Medium | |
| 692 | Top K Frequent Words | Medium | |
| 694 | Number of Distinct Islands | Medium | |
| 695 | Max Area of Island | Medium | |
| 698 | Partition to K Equal Sum Subsets | Medium | |
| 714 | Best Time to Buy and Sell Stock with Transaction Fee | Medium | |
| 724 | Find Pivot Index | Easy | |
| 740 | Delete and Earn | Medium | |
| 743 | Network Delay Time | Medium | |
| 746 | Min Cost Climbing Stairs | Easy | |
| 752 | Open the Lock | Medium | |
| 428 | Serialize and Deserialize N-ary Tree | Hard | |
| 763 | Partition Labels | Medium | |
| 769 | Max Chunks To Make Sorted | Medium | |
| 700 | Search in a Binary Search Tree | Easy | |
| 701 | Insert into a Binary Search Tree | Medium | |
| 703 | Kth Largest Element in a Stream | Easy | |
| 785 | Is Graph Bipartite? | Medium | |
| 787 | Cheapest Flights Within K Stops | Medium | |
| 802 | Find Eventual Safe States | Medium | |
| 707 | Design Linked List | Medium | |
| 836 | Rectangle Overlap | Easy | |
| 841 | Keys and Rooms | Medium | |
| 853 | Car Fleet | Medium | |
| 862 | Shortest Subarray with Sum at Least K | Hard | |
| 867 | Transpose Matrix | Easy | |
| 528 | Random Pick with Weight | Medium | |
| 895 | Maximum Frequency Stack | Hard | |
| 904 | Fruit Into Baskets | Medium | |
| 909 | Snakes and Ladders | Medium | |
| 930 | Binary Subarrays With Sum | Medium | |
| 931 | Minimum Falling Path Sum | Medium | |
| 934 | Shortest Bridge | Medium | |
| 962 | Maximum Width Ramp | Medium | |
| 968 | Binary Tree Cameras | Hard | |
| 972 | Equal Rational Numbers | Hard | |
| 973 | K Closest Points to Origin | Medium | |
| 974 | Subarray Sums Divisible by K | Medium | |
| 977 | Squares of a Sorted Array | Easy | |
| 981 | Time Based Key-Value Store | Medium | |
| 1013 | Partition Array Into Three Parts With Equal Sum | Easy | |
| 1021 | Remove Outermost Parentheses | Easy | |
| 1047 | Remove All Adjacent Duplicates In String | Easy | |
| 1051 | Height Checker | Easy | |
| 1053 | Previous Permutation With One Swap | Medium | |
| 1197 | Minimum Knight Moves | Medium | |
| 1198 | Find Smallest Common Element in All Rows | Medium | |
| 1091 | Shortest Path in Binary Matrix | Medium | |
| 1093 | Statistics from a Large Sample | Medium | |
| 1273 | Delete Tree Nodes | Medium | |
| 1246 | Palindrome Removal | Hard | |
| 1131 | Maximum of Absolute Value Expression | Medium | |
| 1146 | Snapshot Array | Medium | |
| 1382 | Balance a Binary Search Tree | Medium | |
| 1192 | Critical Connections in a Network | Hard | |
| 1405 | Longest Happy String | Medium | |
| 1207 | Unique Number of Occurrences | Easy | |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | |
| 1204 | Last Person to Fit in the Bus | Medium | |
| 1206 | Design Skiplist | Hard | |
| 2321 | Maximum Score Of Spliced Array | Hard | |
| 2216 | Minimum Deletions to Make Array Beautiful | Medium | |
| 2193 | Minimum Number of Moves to Make Palindrome | Hard | |
| 2309 | Greatest English Letter in Upper and Lower Case | Easy | |
| 1248 | Count Number of Nice Subarrays | Medium | |
| 1249 | Minimum Remove to Make Valid Parentheses | Medium | |
| 1268 | Search Suggestions System | Medium | |
| 1369 | Get the Second Most Recent Activity | Hard | |
| 1431 | Kids With the Greatest Number of Candies | Easy | |
| 1417 | Reformat The String | Easy | |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | |
| 1443 | Minimum Time to Collect All Apples in a Tree | Medium | |
| 1458 | Max Dot Product of Two Subsequences | Hard | |
| 1469 | Find All The Lonely Nodes | Easy | |
| 1474 | Delete N Nodes After M Nodes of a Linked List | Easy | |
| 1547 | Minimum Cost to Cut a Stick | Hard | |
| 1573 | Number of Ways to Split a String | Medium | |
| 1576 | Replace All ?'s to Avoid Consecutive Repeating Characters | Easy | |
| 1638 | Count Substrings That Differ by One Character | Medium | |
| 1631 | Path With Minimum Effort | Medium | |
| 1644 | Lowest Common Ancestor of a Binary Tree II | Medium | |
| 1672 | Richest Customer Wealth | Easy | |
| 1681 | Minimum Incompatibility | Hard | |
| 1732 | Find the Highest Altitude | Easy | |
| 1781 | Sum of Beauty of All Substrings | Medium | |
| 1802 | Maximum Value at a Given Index in a Bounded Array | Medium | |
| 1808 | Maximize Number of Nice Divisors | Hard | |
| 1789 | Primary Department for Each Employee | Easy | |
| 1822 | Sign of the Product of an Array | Easy | |
| 1823 | Find the Winner of the Circular Game | Medium | |
| 1904 | The Number of Full Rounds You Have Played | Medium | |
| 2052 | Minimum Cost to Separate Sentence Into Rows | Medium | |
| 1952 | Three Divisors | Easy | |
| 1971 | Find if Path Exists in Graph | Easy | |
| 2015 | Average Height of Buildings in Each Segment | Medium | |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | |
| 2095 | Delete the Middle Node of a Linked List | Medium | |
| 2104 | Sum of Subarray Ranges | Medium | |
| 2098 | Subsequence of Size K With the Largest Even Sum | Medium | |
| 2124 | Check if All A's Appears Before All B's | Easy | |
| 2149 | Rearrange Array Elements by Sign | Medium | |
| 2208 | Minimum Operations to Halve Array Sum | Medium | |
| 2333 | Minimum Sum of Squared Difference | Medium | |
| 2339 | All the Matches of the League | Easy | |
| 2385 | Amount of Time for Binary Tree to Be Infected | Medium | |
| 2391 | Minimum Amount of Time to Collect Garbage | Medium | |
| 2441 | Largest Positive Integer That Exists With Its Negative | Easy | |
| 2444 | Count Subarrays With Fixed Bounds | Hard | |
| 2450 | Number of Distinct Binary Strings After Applying Operations | Medium | |
| 2599 | Make the Prefix Sum Non-negative | Medium | |
| 2548 | Maximum Price to Fill a Bag | Medium | |
| 2620 | Counter | Easy | |
| 2704 | To Be Or Not To Be | Easy | |
| 2816 | Double a Number Represented as a Linked List | Medium | |
| 2847 | Smallest Number With Given Digit Product | Medium | |
| 3002 | Maximum Size of a Set After Removals | Medium | |
| 2996 | Smallest Missing Integer Greater Than Sequential Prefix Sum | Easy | |
| 2998 | Minimum Number of Operations to Make X and Y Equal | Medium | |
| 3004 | Maximum Subtree of the Same Color | Medium | |
| 3009 | Maximum Number of Intersections on the Chart | Hard | |
| 3038 | Maximum Number of Operations With the Same Score I | Easy | |
| 3134 | Find the Median of the Uniqueness Array | Hard | |
| 3111 | Minimum Rectangles to Cover Points | Medium | |
| 3157 | Find the Level of Tree with Minimum Sum | Medium | |
| 3212 | Count Submatrices With Equal Frequency of X and Y | Medium | |
| 389 | Find the Difference | Easy | |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | |
| 132 | Palindrome Partitioning II | Hard | |
| 2401 | Longest Nice Subarray | Medium | |
| 3007 | Maximum Number That Sum of the Prices Is Less Than or Equal to K | Medium | |
| 1934 | Confirmation Rate | Medium | |
| 1633 | Percentage of Users Attended a Contest | Easy | |
| 359 | Logger Rate Limiter | Easy | |
| 1944 | Number of Visible People in a Queue | Hard | |
| 511 | Game Play Analysis I | Easy | |
| 602 | Friend Requests II: Who Has the Most Friends | Medium | |
| 1910 | Remove All Occurrences of a Substring | Medium | |
| 1174 | Immediate Food Delivery II | Medium | |
| 620 | Not Boring Movies | Easy | |
| 815 | Bus Routes | Hard | |
| 263 | Ugly Number | Easy | |
| 177 | Nth Highest Salary | Medium | |
| 662 | Maximum Width of Binary Tree | Medium | |
| 1164 | Product Price at a Given Date | Medium | |
| 2182 | Construct String With Repeat Limit | Medium | |
| 436 | Find Right Interval | Medium | |
| 725 | Split Linked List in Parts | Medium | |
| 3169 | Count Days Without Meetings | Medium | |
| 1512 | Number of Good Pairs | Easy | |
| 241 | Different Ways to Add Parentheses | Medium | |
| 386 | Lexicographical Numbers | Medium | |
| 684 | Redundant Connection | Medium | |
| 440 | K-th Smallest in Lexicographical Order | Hard | |
| 1731 | The Number of Employees Which Report to Each Employee | Easy | |
| 550 | Game Play Analysis IV | Medium | |
| 2965 | Find Missing and Repeated Values | Easy | |
| 632 | Smallest Range Covering Elements from K Lists | Hard | |
| 2938 | Separate Black and White Balls | Medium | |
| 670 | Maximum Swap | Medium | |
| 771 | Jewels and Stones | Easy | |
| 986 | Interval List Intersections | Medium | |
| 60 | Permutation Sequence | Hard | |
| 304 | Range Sum Query 2D - Immutable | Medium | |
| 1046 | Last Stone Weight | Easy | |
| 1531 | String Compression II | Hard | |
| 1683 | Invalid Tweets | Easy | |
| 3163 | String Compression III | Medium | |
| 448 | Find All Numbers Disappeared in an Array | Easy | |
| 1008 | Construct Binary Search Tree from Preorder Traversal | Medium | |
| 2769 | Find the Maximum Achievable Number | Easy | |
| 1493 | Longest Subarray of 1's After Deleting One Element | Medium | |
| 1141 | User Activity for the Past 30 Days I | Easy | |
| 1861 | Rotating the Box | Medium | |
| 1975 | Maximum Matrix Sum | Medium | |
| 374 | Guess Number Higher or Lower | Easy | |
| 182 | Duplicate Emails | Easy | |
| 2054 | Two Best Non-Overlapping Events | Medium | |
| 1792 | Maximum Average Pass Ratio | Medium | |
| 220 | Contains Duplicate III | Hard | |
| 1901 | Find a Peak Element II | Medium | |
| 317 | Shortest Distance from All Buildings | Hard | |
| 686 | Repeated String Match | Medium | |
| 2402 | Meeting Rooms III | Hard | |
| 183 | Customers Who Never Order | Easy | |
| 164 | Maximum Gap | Medium | |
| 3393 | Count Paths With the Given XOR Value | Medium | |
| 916 | Word Subsets | Medium | |
| 480 | Sliding Window Median | Hard | |
| 324 | Wiggle Sort II | Medium | |
| 2017 | Grid Game | Medium | |
| 1267 | Count Servers that Communicate | Medium | |
| 404 | Sum of Left Leaves | Easy | |
| 585 | Investments in 2016 | Medium | |
| 3105 | Longest Strictly Increasing or Strictly Decreasing Subarray | Easy | |
| 449 | Serialize and Deserialize BST | Medium | |
| 1800 | Maximum Ascending Subarray Sum | Easy | |
| 1283 | Find the Smallest Divisor Given a Threshold | Medium | |
| 301 | Remove Invalid Parentheses | Hard | |
| 1275 | Find Winner on a Tic Tac Toe Game | Easy | |
| 1020 | Number of Enclaves | Medium | |
| 1980 | Find Unique Binary String | Medium | |
| 2161 | Partition Array According to Given Pivot | Medium | |
| 1351 | Count Negative Numbers in a Sorted Matrix | Easy | |
| 844 | Backspace String Compare | Easy | |
| 1048 | Longest String Chain | Medium | |
| 372 | Super Pow | Medium | |
| 3477 | Fruits Into Baskets II | Easy | |
| 2226 | Maximum Candies Allocated to K Children | Medium | |
| 2560 | House Robber IV | Medium | |
| 713 | Subarray Product Less Than K | Medium | |
| 3487 | Maximum Unique Subarray Sum After Deletion | Easy | |
| 1277 | Count Square Submatrices with All Ones | Medium | |
| 3191 | Minimum Operations to Make Binary Array Elements Equal to One I | Medium | |
| 1834 | Single-Threaded CPU | Medium | |
| 2623 | Memoize | Medium | |
| 228 | Summary Ranges | Easy | |
| 1863 | Sum of All Subset XOR Totals | Easy | |
| 1456 | Maximum Number of Vowels in a Substring of Given Length | Medium | |
| 190 | Reverse Bits | Easy | |
| 898 | Bitwise ORs of Subarrays | Medium | |
| 611 | Valid Triangle Number | Medium | |
| 417 | Pacific Atlantic Water Flow | Medium | |
| 2296 | Design a Text Editor | Hard | |
| 3403 | Find the Lexicographically Largest String From the Box I | Medium | |
| 3442 | Maximum Difference Between Even and Odd Frequency I | Easy | |
| 3445 | Maximum Difference Between Even and Odd Frequency II | Hard | |
| 3443 | Maximum Manhattan Distance After K Changes | Medium | |
| 2040 | Kth Smallest Product of Two Sorted Arrays | Hard | |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | Hard | |
| 2561 | Rearranging Fruits | Hard | |
| 196 | Delete Duplicate Emails | Easy | |
| 2861 | Maximum Number of Alloys | Medium | |
| 1413 | Minimum Value to Get Positive Step by Step Sum | Easy | |
| 1535 | Find the Winner of an Array Game | Medium | |
| 504 | Base 7 | Easy | |
| 1200 | Minimum Absolute Difference | Easy | |
| 586 | Customer Placing the Largest Number of Orders | Easy | |
| 507 | Perfect Number | Easy | |
| 869 | Reordered Power of 2 | Medium | |
| 1211 | Queries Quality and Percentage | Easy | |
| 848 | Shifting Letters | Medium | |
| 837 | New 21 Game | Medium | |
| 679 | 24 Game | Hard | |
| 2472 | Maximum Number of Non-overlapping Palindrome Substrings | Hard | |
| 779 | K-th Symbol in Grammar | Medium | |
| 3229 | Minimum Operations to Make Array Equal to Target | Hard | |
| 1317 | Convert Integer to the Sum of Two No-Zero Integers | Easy | |
| 966 | Vowel Spellchecker | Medium | |
| 3688 | Bitwise OR of Even Numbers in an Array | Easy | |
| 3648 | Minimum Sensors to Cover Grid | Medium | |
| 1665 | Minimum Initial Energy to Finish Tasks | Hard | |
| 2954 | Count the Number of Infection Sequences | Hard | |
| 1202 | Smallest String With Swaps | Medium | |
| 2680 | Maximum OR | Medium | |
| 829 | Consecutive Numbers Sum | Hard | |
| 1347 | Minimum Number of Steps to Make Two Strings Anagram | Medium | |
| 1716 | Calculate Money in Leetcode Bank | Easy | |
| 3728 | Stable Subarrays With Equal Boundary and Interior Sum | Medium | |
| 1502 | Can Make Arithmetic Progression From Sequence | Easy | |
| 980 | Unique Paths III | Hard | |
| 3772 | Maximum Subgraph Score in a Tree | Hard | |
| 1365 | How Many Numbers Are Smaller Than the Current Number | Easy | |
| 3507 | Minimum Pair Removal to Sort Array I | Easy | |
| 1356 | Sort Integers by The Number of 1 Bits | Easy | |
| 3878 | Count Good Subarrays | Hard | |
| 1674 | Minimum Moves to Make Array Complementary | Medium | |
| 3737 | Count Subarrays With Majority Element I | Medium | |
| 3754 | Concatenate Non-Zero Digits and Multiply by Sum I | Easy | |
| 95 | Unique Binary Search Trees II | Medium | |
| 96 | Unique Binary Search Trees | Medium | |
| 109 | Convert Sorted List to Binary Search Tree | Medium | |
| 145 | Binary Tree Postorder Traversal | Easy | |
| 147 | Insertion Sort List | Medium | |
| 260 | Single Number III | Medium | |
| 261 | Graph Valid Tree | Medium | |
| 266 | Palindrome Permutation | Easy | |
| 310 | Minimum Height Trees | Medium | |
| 319 | Bulb Switcher | Medium | |
| 325 | Maximum Size Subarray Sum Equals k | Medium | |
| 341 | Flatten Nested List Iterator | Medium | |
| 342 | Power of Four | Easy | |
| 343 | Integer Break | Medium | |
| 384 | Shuffle an Array | Medium | |
| 400 | Nth Digit | Medium | |
| 414 | Third Maximum Number | Easy | |
| 420 | Strong Password Checker | Hard | |
| 421 | Maximum XOR of Two Numbers in an Array | Medium | |
| 433 | Minimum Genetic Mutation | Medium | |
| 456 | 132 Pattern | Medium | |
| 462 | Minimum Moves to Equal Array Elements II | Medium | |
| 465 | Optimal Account Balancing | Hard | |
| 486 | Predict the Winner | Medium | |
| 515 | Find Largest Value in Each Tree Row | Medium | |
| 535 | Encode and Decode TinyURL | Medium | |
| 557 | Reverse Words in a String III | Easy | |
| 628 | Maximum Product of Three Numbers | Easy | |
| 633 | Sum of Square Numbers | Medium | |
| 648 | Replace Words | Medium | |
| 652 | Find Duplicate Subtrees | Medium | |
| 661 | Image Smoother | Easy | |
| 718 | Maximum Length of Repeated Subarray | Medium | |
| 741 | Cherry Pickup | Hard | |
| 426 | Convert Binary Search Tree to Sorted Doubly Linked List | Medium | |
| 778 | Swim in Rising Water | Hard | |
| 784 | Letter Case Permutation | Medium | |
| 790 | Domino and Tromino Tiling | Medium | |
| 791 | Custom Sort String | Medium | |
| 819 | Most Common Word | Easy | |
| 828 | Count Unique Characters of All Substrings of a Given String | Hard | |
| 834 | Sum of Distances in Tree | Hard | |
| 489 | Robot Room Cleaner | Hard | |
| 846 | Hand of Straights | Medium | |
| 857 | Minimum Cost to Hire K Workers | Hard | |
| 881 | Boats to Save People | Medium | |
| 894 | All Possible Full Binary Trees | Medium | |
| 905 | Sort Array By Parity | Easy | |
| 918 | Maximum Sum Circular Subarray | Medium | |
| 921 | Minimum Add to Make Parentheses Valid | Medium | |
| 938 | Range Sum of BST | Easy | |
| 947 | Most Stones Removed with Same Row or Column | Medium | |
| 949 | Largest Time for Given Digits | Medium | |
| 950 | Reveal Cards In Increasing Order | Medium | |
| 956 | Tallest Billboard | Hard | |
| 979 | Distribute Coins in Binary Tree | Medium | |
| 993 | Cousins in Binary Tree | Easy | |
| 997 | Find the Town Judge | Easy | |
| 1002 | Find Common Characters | Easy | |
| 1007 | Minimum Domino Rotations For Equal Row | Medium | |
| 1035 | Uncrossed Lines | Medium | |
| 1166 | Design File System | Medium | |
| 1070 | Product Sales Analysis III | Medium | |
| 1106 | Parsing A Boolean Expression | Hard | |
| 1361 | Validate Binary Tree Nodes | Medium | |
| 1239 | Maximum Length of a Concatenated String with Unique Characters | Medium | |
| 1254 | Number of Closed Islands | Medium | |
| 1290 | Convert Binary Number in a Linked List to Integer | Easy | |
| 1342 | Number of Steps to Reduce a Number to Zero | Easy | |
| 1372 | Longest ZigZag Path in a Binary Tree | Medium | |
| 1376 | Time Needed to Inform All Employees | Medium | |
| 1404 | Number of Steps to Reduce a Number in Binary Representation to One | Medium | |
| 1472 | Design Browser History | Medium | |
| 1492 | The kth Factor of n | Medium | |
| 1557 | Minimum Number of Vertices to Reach All Nodes | Medium | |
| 1545 | Find Kth Bit in Nth Binary String | Medium | |
| 1584 | Min Cost to Connect All Points | Medium | |
| 1570 | Dot Product of Two Sparse Vectors | Medium | |
| 1636 | Sort Array by Increasing Frequency | Easy | |
| 1669 | Merge In Between Linked Lists | Medium | |
| 1679 | Max Number of K-Sum Pairs | Medium | |
| 1723 | Find Minimum Time to Finish All Jobs | Hard | |
| 1751 | Maximum Number of Events That Can Be Attended II | Hard | |
| 1762 | Buildings With an Ocean View | Medium | |
| 1884 | Egg Drop With 2 Eggs and N Floors | Medium | |
| 1942 | The Number of the Smallest Unoccupied Chair | Medium | |
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | Medium | |
| 2073 | Time Needed to Buy Tickets | Easy | |
| 2130 | Maximum Twin Sum of a Linked List | Medium | |
| 2220 | Minimum Bit Flips to Convert Number | Easy | |
| 2239 | Find Closest Number to Zero | Easy | |
| 2236 | Root Equals Sum of Children | Easy | |
| 2332 | The Latest Time to Catch a Bus | Medium | |
| 2352 | Equal Row and Column Pairs | Medium | |
| 2342 | Max Sum of a Pair With Equal Sum of Digits | Medium | |
| 2461 | Maximum Sum of Distinct Subarrays With Length K | Medium | |
| 2498 | Frog Jump II | Medium | |
| 2542 | Maximum Subsequence Score | Medium | |
| 2616 | Minimize the Maximum Difference of Pairs | Medium | |
| 2745 | Construct the Longest New String | Medium | |
| 2723 | Add Two Promises | Easy | |
| 2850 | Minimum Moves to Spread Stones Over Grid | Medium | |
| 2942 | Find Words Containing Character | Easy | |
| 2962 | Count Subarrays Where Max Element Appears at Least K Times | Medium | |
| 3110 | Score of a String | Easy | |
| 3121 | Count the Number of Special Characters II | Medium | |
| 3197 | Find the Minimum Area to Cover All Ones II | Hard | |
| 1244 | Design A Leaderboard | Medium | |
| 3024 | Type of Triangle | Easy | |
| 745 | Prefix and Suffix Search | Hard | |
| 2976 | Minimum Cost to Convert String I | Medium | |
| 3234 | Count the Number of Substrings With Dominant Ones | Medium | |
| 259 | 3Sum Smaller | Medium | |
| 1460 | Make Two Arrays Equal by Reversing Subarrays | Easy | |
| 3099 | Harshad Number | Easy | |
| 1865 | Finding Pairs With a Certain Sum | Medium | |
| 847 | Shortest Path Visiting All Nodes | Hard | |
| 885 | Spiral Matrix III | Medium | |
| 872 | Leaf-Similar Trees | Easy | |
| 840 | Magic Squares In Grid | Medium | |
| 959 | Regions Cut By Slashes | Medium | |
| 915 | Partition Array into Disjoint Intervals | Medium | |
| 860 | Lemonade Change | Easy | |
| 624 | Maximum Distance in Arrays | Medium | |
| 887 | Super Egg Drop | Hard | |
| 1932 | Merge BSTs to Create Single BST | Hard | |
| 1937 | Maximum Number of Points with Cost | Medium | |
| 3259 | Maximum Energy Boost From Two Drinks | Medium | |
| 664 | Strange Printer | Hard | |
| 1717 | Maximum Score From Removing Substrings | Medium | |
| 2645 | Minimum Additions to Make Valid String | Medium | |
| 1514 | Path with Maximum Probability | Medium | |
| 2326 | Spiral Matrix IV | Medium | |
| 2807 | Insert Greatest Common Divisors in Linked List | Medium | |
| 243 | Shortest Word Distance | Easy | |
| 1654 | Minimum Jumps to Reach Home | Medium | |
| 483 | Smallest Good Base | Hard | |
| 941 | Valid Mountain Array | Easy | |
| 1608 | Special Array With X Elements Greater Than or Equal X | Easy | |
| 1688 | Count of Matches in Tournament | Easy | |
| 3043 | Find the Length of the Longest Common Prefix | Medium | |
| 814 | Binary Tree Pruning | Medium | |
| 500 | Keyboard Row | Easy | |
| 1381 | Design a Stack With Increment Operation | Medium | |
| 1614 | Maximum Nesting Depth of the Parentheses | Easy | |
| 1497 | Check If Array Pairs Are Divisible by k | Medium | |
| 459 | Repeated Substring Pattern | Easy | |
| 1331 | Rank Transform of an Array | Easy | |
| 1590 | Make Sum Divisible by P | Medium | |
| 2598 | Smallest Missing Non-negative Integer After Operations | Medium | |
| 2491 | Divide Players Into Teams of Equal Skill | Medium | |
| 825 | Friends Of Appropriate Ages | Medium | |
| 1963 | Minimum Number of Swaps to Make the String Balanced | Medium | |
| 744 | Find Smallest Letter Greater Than Target | Easy | |
| 2619 | Array Prototype Last | Easy | |
| 2390 | Removing Stars From a String | Medium | |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | Medium | |
| 1593 | Split a String Into the Max Number of Unique Substrings | Medium | |
| 470 | Implement Rand10() Using Rand7() | Medium | |
| 2583 | Kth Largest Sum in a Binary Tree | Medium | |
| 429 | N-ary Tree Level Order Traversal | Medium | |
| 1233 | Remove Sub-Folders from the Filesystem | Medium | |
| 1252 | Cells with Odd Values in a Matrix | Easy | |
| 2501 | Longest Square Streak in an Array | Medium | |
| 1804 | Implement Trie II (Prefix Tree) | Medium | |
| 2463 | Minimum Total Distance Traveled | Hard | |
| 690 | Employee Importance | Medium | |
| 3011 | Find if Array Can Be Sorted | Medium | |
| 801 | Minimum Swaps To Make Sequences Increasing | Hard | |
| 3097 | Shortest Subarray With OR at Least K II | Medium | |
| 286 | Walls and Gates | Medium | |
| 2601 | Prime Subtraction Operation | Medium | |
| 3211 | Generate Binary Strings Without Adjacent Zeros | Medium | |
| 1957 | Delete Characters to Make Fancy String | Easy | |
| 719 | Find K-th Smallest Pair Distance | Hard | |
| 1652 | Defuse the Bomb | Easy | |
| 1072 | Flip Columns For Maximum Number of Equal Rows | Medium | |
| 1327 | List the Products Ordered in a Period | Easy | |
| 3243 | Shortest Distance After Road Addition Queries I | Medium | |
| 1179 | Reformat Department Table | Easy | |
| 2577 | Minimum Time to Visit a Cell In a Grid | Hard | |
| 1455 | Check If a Word Occurs As a Prefix of Any Word in a Sentence | Easy | |
| 1346 | Check If N and Its Double Exist | Easy | |
| 2165 | Smallest Value of the Rearranged Number | Medium | |
| 1667 | Fix Names in a Table | Easy | |
| 2337 | Move Pieces to Obtain a String | Medium | |
| 2483 | Minimum Penalty for a Shop | Medium | |
| 2210 | Count Hills and Valleys in an Array | Easy | |
| 2061 | Number of Spaces Cleaning Robot Cleaned | Medium | |
| 3152 | Special Array II | Medium | |
| 682 | Baseball Game | Easy | |
| 2981 | Find Longest Special Substring That Occurs Thrice I | Medium | |
| 629 | K Inverse Pairs Array | Hard | |
| 291 | Word Pattern II | Medium | |
| 3264 | Final Array State After K Multiplication Operations I | Easy | |
| 1373 | Maximum Sum BST in Binary Tree | Hard | |
| 1839 | Longest Substring Of All Vowels in Order | Medium | |
| 1229 | Meeting Scheduler | Medium | |
| 2824 | Count Pairs Whose Sum is Less than Target | Easy | |
| 689 | Maximum Sum of 3 Non-Overlapping Subarrays | Hard | |
| 481 | Magical String | Medium | |
| 1657 | Determine if Two Strings Are Close | Medium | |
| 453 | Minimum Moves to Equal Array Elements | Medium | |
| 2970 | Count the Number of Incremovable Subarrays I | Easy | |
| 1401 | Circle and Rectangle Overlapping | Medium | |
| 2559 | Count Vowel Strings in Ranges | Medium | |
| 2270 | Number of Ways to Split Array | Medium | |
| 1930 | Unique Length-3 Palindromic Subsequences | Medium | |
| 1408 | String Matching in an Array | Easy | |
| 2185 | Counting Words With a Given Prefix | Easy | |
| 1400 | Construct K Palindrome Strings | Medium | |
| 1926 | Nearest Exit from Entrance in Maze | Medium | |
| 1169 | Invalid Transactions | Medium | |
| 3420 | Count Non-Decreasing Subarrays After K Operations | Hard | |
| 2657 | Find the Prefix Common Array of Two Arrays | Medium | |
| 2429 | Minimize XOR | Medium | |
| 541 | Reverse String II | Easy | |
| 1729 | Find Followers Count | Easy | |
| 627 | Swap Sex of Employees | Easy | |
| 1321 | Restaurant Growth | Medium | |
| 1462 | Course Schedule IV | Medium | |
| 2658 | Maximum Number of Fish in a Grid | Medium | |
| 1769 | Minimum Number of Operations to Move All Balls to Each Box | Medium | |
| 2493 | Divide Nodes Into the Maximum Number of Groups | Hard | |
| 3151 | Special Array I | Easy | |
| 851 | Loud and Rich | Medium | |
| 583 | Delete Operation for Two Strings | Medium | |
| 1790 | Check if One String Swap Can Make Strings Equal | Easy | |
| 1034 | Coloring A Border | Medium | |
| 1726 | Tuple with Same Product | Medium | |
| 2109 | Adding Spaces to a String | Medium | |
| 520 | Detect Capital | Easy | |
| 1075 | Project Employees I | Easy | |
| 1043 | Partition Array for Maximum Sum | Medium | |
| 1352 | Product of the Last K Numbers | Medium | |
| 1718 | Construct the Lexicographically Largest Valid Sequence | Medium | |
| 3348 | Smallest Divisible Digit Product II | Hard | |
| 65 | Valid Number | Hard | |
| 946 | Validate Stack Sequences | Medium | |
| 3462 | Maximum Sum With at Most K Elements | Medium | |
| 1524 | Number of Sub-arrays With Odd Sum | Medium | |
| 873 | Length of Longest Fibonacci Subsequence | Medium | |
| 532 | K-diff Pairs in an Array | Medium | |
| 889 | Construct Binary Tree from Preorder and Postorder Traversal | Medium | |
| 1749 | Maximum Absolute Sum of Any Subarray | Medium | |
| 1028 | Recover a Tree From Preorder Traversal | Hard | |
| 2579 | Count Total Number of Colored Cells | Medium | |
| 2523 | Closest Prime Numbers in Range | Medium | |
| 3208 | Alternating Groups II | Medium | |
| 1824 | Minimum Sideway Jumps | Medium | |
| 610 | Triangle Judgement | Easy | |
| 2134 | Minimum Swaps to Group All 1's Together II | Medium | |
| 2529 | Maximum Count of Positive Integer and Negative Integer | Easy | |
| 1886 | Determine Whether Matrix Can Be Obtained By Rotation | Easy | |
| 89 | Gray Code | Medium | |
| 3108 | Minimum Cost Walk in Weighted Graph | Hard | |
| 2594 | Minimum Time to Repair Cars | Medium | |
| 2685 | Count the Number of Complete Components | Medium | |
| 845 | Longest Mountain in Array | Medium | |
| 2033 | Minimum Operations to Make a Uni-Value Grid | Medium | |
| 2780 | Minimum Index of a Valid Split | Medium | |
| 637 | Average of Levels in Binary Tree | Easy | |
| 2874 | Maximum Value of an Ordered Triplet II | Medium | |
| 1907 | Count Salary Categories | Medium | |
| 1129 | Shortest Path with Alternating Colors | Medium | |
| 3217 | Delete Nodes From Linked List Present in Array | Medium | |
| 3396 | Minimum Number of Operations to Make Elements in Array Distinct | Easy | |
| 1049 | Last Stone Weight II | Medium | |
| 3375 | Minimum Operations to Make Array Values Equal to K | Easy | |
| 2843 | Count Symmetric Integers | Easy | |
| 2487 | Remove Nodes From Linked List | Medium | |
| 2537 | Count the Number of Good Subarrays | Medium | |
| 2481 | Minimum Cuts to Divide a Circle | Easy | |
| 2176 | Count Equal and Divisible Pairs in an Array | Easy | |
| 2563 | Count the Number of Fair Pairs | Medium | |
| 781 | Rabbits in Forest | Medium | |
| 2064 | Minimized Maximum of Products Distributed to Any Store | Medium | |
| 2462 | Total Cost to Hire K Workers | Medium | |
| 2338 | Count the Number of Ideal Arrays | Hard | |
| 983 | Minimum Cost For Tickets | Medium | |
| 2845 | Count of Interesting Subarrays | Medium | |
| 3517 | Smallest Palindromic Rearrangement I | Medium | |
| 2302 | Count Subarrays With Score Less Than K | Hard | |
| 636 | Exclusive Time of Functions | Medium | |
| 1295 | Find Numbers with Even Number of Digits | Easy | |
| 838 | Push Dominoes | Medium | |
| 201 | Bitwise AND of Numbers Range | Medium | |
| 1920 | Build Array from Permutation | Easy | |
| 1461 | Check If a String Contains All Binary Codes of Size K | Medium | |
| 1903 | Largest Odd Number in String | Easy | |
| 617 | Merge Two Binary Trees | Easy | |
| 2140 | Solving Questions With Brainpower | Medium | |
| 2336 | Smallest Number in Infinite Set | Medium | |
| 2094 | Finding 3-Digit Even Numbers | Easy | |
| 3392 | Count Subarrays of Length Three With a Condition | Easy | |
| 1664 | Ways to Make a Fair Array | Medium | |
| 1931 | Painting a Grid With Three Different Colors | Hard | |
| 3355 | Zero Array Transformation I | Medium | |
| 780 | Reaching Points | Hard | |
| 922 | Sort Array By Parity II | Easy | |
| 3362 | Zero Array Transformation III | Medium | |
| 2006 | Count Number of Pairs With Absolute Difference K | Easy | |
| 2131 | Longest Palindrome by Concatenating Two Letter Words | Medium | |
| 2762 | Continuous Subarrays | Medium | |
| 2101 | Detonate the Maximum Bombs | Medium | |
| 434 | Number of Segments in a String | Easy | |
| 1217 | Minimum Cost to Move Chips to The Same Position | Easy | |
| 1976 | Number of Ways to Arrive at Destination | Medium | |
| 1219 | Path with Maximum Gold | Medium | |
| 1050 | Actors and Directors Who Cooperated At Least Three Times | Easy | |
| 3170 | Lexicographically Minimum String After Removing Stars | Medium | |
| 2009 | Minimum Number of Operations to Make Array Continuous | Hard | |
| 874 | Walking Robot Simulation | Medium | |
| 3576 | Transform Array to All Equal Elements | Medium | |
| 1859 | Sorting the Sentence | Easy | |
| 2618 | Check if Object Instance of Class | Medium | |
| 3434 | Maximum Frequency After Subarray Operation | Medium | |
| 3423 | Maximum Difference Between Adjacent Elements in a Circular Array | Easy | |
| 933 | Number of Recent Calls | Easy | |
| 951 | Flip Equivalent Binary Trees | Medium | |
| 1319 | Number of Operations to Make Network Connected | Medium | |
| 2966 | Divide Array Into Arrays With Max Difference | Medium | |
| 1696 | Jump Game VI | Medium | |
| 2114 | Maximum Number of Words Found in Sentences | Easy | |
| 1721 | Swapping Nodes in a Linked List | Medium | |
| 2081 | Sum of k-Mirror Numbers | Hard | |
| 538 | Convert BST to Greater Tree | Medium | |
| 958 | Check Completeness of a Binary Tree | Medium | |
| 1094 | Car Pooling | Medium | |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | Medium | |
| 1572 | Matrix Diagonal Sum | Easy | |
| 3333 | Find the Original Typed String II | Hard | |
| 3304 | Find the K-th Character in String Game I | Easy | |
| 381 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | |
| 3330 | Find the Original Typed String I | Easy | |
| 1760 | Minimum Limit of Balls in a Bag | Medium | |
| 3440 | Reschedule Meetings for Maximum Free Time II | Medium | |
| 754 | Reach a Number | Medium | |
| 1529 | Minimum Suffix Flips | Medium | |
| 2266 | Count Number of Texts | Medium | |
| 1392 | Longest Happy Prefix | Hard | |
| 3201 | Find the Maximum Length of Valid Subsequence I | Medium | |
| 3202 | Find the Maximum Length of Valid Subsequence II | Medium | |
| 2163 | Minimum Difference in Sums After Removal of Elements | Hard | |
| 1948 | Delete Duplicate Folders in System | Hard | |
| 1695 | Maximum Erasure Value | Medium | |
| 2322 | Minimum Score After Removals on a Tree | Hard | |
| 2448 | Minimum Cost to Make Array Equal | Hard | |
| 821 | Shortest Distance to a Character | Easy | |
| 1337 | The K Weakest Rows in a Matrix | Easy | |
| 3480 | Maximize Subarrays After Removing One Conflicting Pair | Hard | |
| 2433 | Find The Original Array of Prefix Xor | Medium | |
| 843 | Guess the Word | Hard | |
| 2411 | Smallest Subarrays With Maximum Bitwise OR | Medium | |
| 2570 | Merge Two 2D Arrays by Summing Values | Easy | |
| 2419 | Longest Subarray With Maximum Bitwise AND | Medium | |
| 2592 | Maximize Greatness of an Array | Medium | |
| 2106 | Maximum Fruits Harvested After at Most K Steps | Hard | |
| 3479 | Fruits Into Baskets III | Medium | |
| 1025 | Divisor Game | Easy | |
| 913 | Cat and Mouse | Hard | |
| 1402 | Reducing Dishes | Hard | |
| 2787 | Ways to Express an Integer as Sum of Powers | Medium | |
| 1385 | Find the Distance Value Between Two Arrays | Easy | |
| 1323 | Maximum 69 Number | Easy | |
| 1109 | Corporate Flight Bookings | Medium | |
| 1089 | Duplicate Zeros | Easy | |
| 353 | Design Snake Game | Medium | |
| 2348 | Number of Zero-Filled Subarrays | Medium | |
| 2328 | Number of Increasing Paths in a Grid | Hard | |
| 332 | Reconstruct Itinerary | Hard | |
| 1163 | Last Substring in Lexicographical Order | Hard | |
| 1247 | Minimum Swaps to Make Strings Equal | Medium | |
| 1287 | Element Appearing More Than 25% In Sorted Array | Easy | |
| 3459 | Length of Longest V-Shaped Diagonal Segment | Hard | |
| 2364 | Count Number of Bad Pairs | Medium | |
| 3144 | Minimum Substring Partition of Equal Character Frequency | Medium | |
| 1162 | As Far from Land as Possible | Medium | |
| 3021 | Alice and Bob Playing Flower Game | Medium | |
| 561 | Array Partition | Easy | |
| 3665 | Twisted Mirror Path Count | Medium | |
| 697 | Degree of an Array | Easy | |
| 2626 | Array Reduce Transformation | Easy | |
| 2300 | Successful Pairs of Spells and Potions | Medium | |
| 924 | Minimize Malware Spread | Hard | |
| 917 | Reverse Only Letters | Easy | |
| 166 | Fraction to Recurring Decimal | Medium | |
| 192 | Word Frequency | Medium | |
| 1451 | Rearrange Words in a Sentence | Medium | |
| 2327 | Number of People Aware of a Secret | Medium | |
| 2785 | Sort Vowels in a String | Medium | |
| 582 | Kill Process | Medium | |
| 1935 | Maximum Number of Words You Can Type | Easy | |
| 2353 | Design a Food Rating System | Medium | |
| 3408 | Design Task Manager | Medium | |
| 3484 | Design Spreadsheet | Medium | |
| 3508 | Implement Router | Medium | |
| 430 | Flatten a Multilevel Doubly Linked List | Medium | |
| 2000 | Reverse Prefix of Word | Easy | |
| 1995 | Count Special Quadruplets | Easy | |
| 3005 | Count Elements With Maximum Frequency | Easy | |
| 2551 | Put Marbles in Bags | Hard | |
| 1041 | Robot Bounded In Circle | Medium | |
| 546 | Remove Boxes | Hard | |
| 2022 | Convert 1D Array Into 2D Array | Easy | |
| 1039 | Minimum Score Triangulation of Polygon | Medium | |
| 2221 | Find Triangular Sum of an Array | Medium | |
| 1245 | Tree Diameter | Medium | |
| 256 | Paint House | Medium | |
| 1832 | Check if the Sentence Is Pangram | Easy | |
| 2914 | Minimum Number of Changes to Make Binary String Beautiful | Medium | |
| 1341 | Movie Rating | Medium | |
| 3494 | Find the Minimum Amount of Time to Brew Potions | Medium | |
| 2320 | Count Number of Ways to Place Houses | Medium | |
| 1537 | Get the Maximum Score | Hard | |
| 313 | Super Ugly Number | Medium | |
| 991 | Broken Calculator | Medium | |
| 2273 | Find Resultant Array After Removing Anagrams | Easy | |
| 3349 | Adjacent Increasing Subarrays Detection I | Easy | |
| 3195 | Find the Minimum Area to Cover All Ones I | Medium | |
| 600 | Non-negative Integers without Consecutive Ones | Hard | |
| 2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | |
| 1226 | The Dining Philosophers | Medium | |
| 2550 | Count Collisions of Monkeys on a Polygon | Medium | |
| 1095 | Find in Mountain Array | Hard | |
| 811 | Subdomain Visit Count | Medium | |
| 309 | Best Time to Buy and Sell Stock with Cooldown | Medium | |
| 3461 | Check If Digits Are Equal in String After Operations I | Easy | |
| 1845 | Seat Reservation Manager | Medium | |
| 2048 | Next Greater Numerically Balanced Number | Medium | |
| 1186 | Maximum Subarray Sum with One Deletion | Medium | |
| 3035 | Maximum Palindromes After Operations | Medium | |
| 858 | Mirror Reflection | Medium | |
| 2370 | Longest Ideal Subsequence | Medium | |
| 2908 | Minimum Sum of Mountain Triplets I | Easy | |
| 3354 | Make Array Elements Equal to Zero | Easy | |
| 773 | Sliding Puzzle | Hard | |
| 3370 | Smallest Number With All Set Bits | Easy | |
| 1297 | Maximum Number of Occurrences of a Substring | Medium | |
| 3289 | The Two Sneaky Numbers of Digitville | Easy | |
| 307 | Range Sum Query - Mutable | Medium | |
| 2257 | Count Unguarded Cells in the Grid | Medium | |
| 3318 | Find X-Sum of All K-Long Subarrays I | Easy | |
| 3607 | Power Grid Maintenance | Medium | |
| 3446 | Sort Matrix by Diagonals | Medium | |
| 2062 | Count Vowel Substrings of a String | Easy | |
| 3593 | Minimum Increments to Equalize Leaf Paths | Medium | |
| 2164 | Sort Even and Odd Indices Independently | Easy | |
| 609 | Find Duplicate File in System | Medium | |
| 2880 | Select Data | Easy | |
| 902 | Numbers At Most N Given Digit Set | Hard | |
| 296 | Best Meeting Point | Hard | |
| 757 | Set Intersection Size At Least Two | Hard | |
| 1079 | Letter Tile Possibilities | Medium | |
| 1236 | Web Crawler | Medium | |
| 799 | Champagne Tower | Medium | |
| 1262 | Greatest Sum Divisible by Three | Medium | |
| 709 | To Lower Case | Easy | |
| 1015 | Smallest Integer Divisible by K | Medium | |
| 2466 | Count Ways To Build Good Strings | Medium | |
| 2435 | Paths in Matrix Whose Sum Is Divisible by K | Hard | |
| 2872 | Maximum Number of K-Divisible Components | Hard | |
| 3512 | Minimum Operations to Make Array Sum Divisible by K | Easy | |
| 1325 | Delete Leaves With a Given Value | Medium | |
| 336 | Palindrome Pairs | Hard | |
| 3432 | Count Partitions with Even Sum Difference | Easy | |
| 3306 | Count of Substrings Containing Every Vowel and K Consonants II | Medium | |
| 1309 | Decrypt String from Alphabet to Integer Mapping | Easy | |
| 3578 | Count Partitions With Max-Min Difference at Most K | Medium | |
| 1018 | Binary Prefix Divisible By 5 | Easy | |
| 3433 | Count Mentions Per User | Medium | |
| 1250 | Check If It Is a Good Array | Hard | |
| 529 | Minesweeper | Medium | |
| 2110 | Number of Smooth Descent Periods of a Stock | Medium | |
| 2147 | Number of Ways to Divide a Long Corridor | Hard | |
| 1188 | Design Bounded Blocking Queue | Medium | |
| 3652 | Best Time to Buy and Sell Stock using Strategy | Medium | |
| 1463 | Cherry Pickup II | Hard | |
| 1185 | Day of the Week | Easy | |
| 3075 | Maximize Happiness of Selected Children | Medium | |
| 2011 | Final Value of Variable After Performing Operations | Easy | |
| 3658 | GCD of Odd and Even Sums | Easy | |
| 3193 | Count the Number of Inversions | Hard | |
| 1966 | Binary Searchable Numbers in an Unsorted Array | Medium | |
| 2439 | Minimize Maximum of Array | Medium | |
| 1411 | Number of Ways to Paint N × 3 Grid | Hard | |
| 925 | Long Pressed Name | Easy | |
| 1390 | Four Divisors | Medium | |
| 2798 | Number of Employees Who Met the Target | Easy | |
| 1161 | Maximum Level Sum of a Binary Tree | Medium | |
| 952 | Largest Component Size by Common Factor | Hard | |
| 1266 | Minimum Time Visiting All Points | Easy | |
| 3203 | Find Minimum Diameter After Merging Two Trees | Hard | |
| 3803 | Count Residue Prefixes | Easy | |
| 1108 | Defanging an IP Address | Easy | |
| 321 | Create Maximum Number | Hard | |
| 3047 | Find the Largest Area of Square Inside Two Rectangles | Medium | |
| 1441 | Build an Array With Stack Operations | Medium | |
| 3314 | Construct the Minimum Bitwise Array I | Easy | |
| 3315 | Construct the Minimum Bitwise Array II | Medium | |
| 107 | Binary Tree Level Order Traversal II | Medium | |
| 2726 | Calculator with Method Chaining | Easy | |
| 3006 | Find Beautiful Indices in the Given Array I | Medium | |
| 729 | My Calendar I | Medium | |
| 3510 | Minimum Pair Removal to Sort Array II | Hard | |
| 788 | Rotated Digits | Medium | |
| 1984 | Minimum Difference Between Highest and Lowest of K Scores | Easy | |
| 1552 | Magnetic Force Between Two Balls | Medium | |
| 3797 | Count Routes to Climb a Rectangular Grid | Hard | |
| 1624 | Largest Substring Between Two Equal Characters | Easy | |
| 1326 | Minimum Number of Taps to Open to Water a Garden | Hard | |
| 3650 | Minimum Cost Path with Edge Reversals | Medium | |
| 2643 | Row With Maximum Ones | Easy | |
| 490 | The Maze | Medium | |
| 759 | Employee Free Time | Hard | |
| 1776 | Car Fleet II | Hard | |
| 3010 | Divide an Array Into Subarrays With Minimum Cost I | Easy | |
| 262 | Trips and Users | Hard | |
| 2492 | Minimum Score of a Path Between Two Cities | Medium | |
| 3640 | Trionic Array II | Hard | |
| 2629 | Function Composition | Easy | |
| 3379 | Transformed Array | Easy | |
| 3814 | Maximum Capacity Within Budget | Medium | |
| 2197 | Replace Non-Coprime Numbers in Array | Hard | |
| 1189 | Maximum Number of Balloons | Easy | |
| 3090 | Maximum Length Substring With Two Occurrences | Easy | |
| 1348 | Tweet Counts Per Frequency | Medium | |
| 1037 | Valid Boomerang | Easy | |
| 824 | Goat Latin | Easy | |
| 2204 | Distance to a Cycle in Undirected Graph | Hard | |
| 3714 | Longest Balanced Substring II | Medium | |
| 401 | Binary Watch | Easy | |
| 3613 | Minimize Maximum Component Cost | Medium | |
| 693 | Binary Number with Alternating Bits | Easy | |
| 1429 | First Unique Number | Medium | |
| 1137 | N-th Tribonacci Number | Easy | |
| 868 | Binary Gap | Easy | |
| 765 | Couples Holding Hands | Hard | |
| 2299 | Strong Password Checker II | Easy | |
| 1022 | Sum of Root To Leaf Binary Numbers | Easy | |
| 405 | Convert a Number to Hexadecimal | Easy | |
| 2974 | Minimum Number Game | Easy | |
| 2050 | Parallel Courses III | Hard | |
| 3666 | Minimum Operations to Equalize Binary String | Hard | |
| 388 | Longest Absolute File Path | Medium | |
| 3366 | Minimum Array Sum | Medium | |
| 939 | Minimum Area Rectangle | Medium | |
| 3186 | Maximum Total Damage With Spell Casting | Medium | |
| 357 | Count Numbers with Unique Digits | Medium | |
| 594 | Longest Harmonious Subsequence | Easy | |
| 1758 | Minimum Changes To Make Alternating Binary String | Easy | |
| 832 | Flipping an Image | Easy | |
| 1888 | Minimum Number of Flips to Make the Binary String Alternating | Medium | |
| 1000 | Minimum Cost to Merge Stones | Hard | |
| 1195 | Fizz Buzz Multithreaded | Medium | |
| 2977 | Minimum Cost to Convert String II | Hard | |
| 728 | Self Dividing Numbers | Easy | |
| 2622 | Cache With Time Limit | Medium | |
| 506 | Relative Ranks | Easy | |
| 747 | Largest Number At Least Twice of Others | Easy | |
| 3600 | Maximize Spanning Tree Stability with Upgrades | Hard | |
| 1349 | Maximum Students Taking Exam | Hard | |
| 1727 | Largest Submatrix With Rearrangements | Medium | |
| 2831 | Find the Longest Equal Subarray | Medium | |
| 216 | Combination Sum III | Medium | |
| 159 | Longest Substring with At Most Two Distinct Characters | Medium | |
| 2151 | Maximum Good People Based on Statements | Hard | |
| 1594 | Maximum Non Negative Product in a Matrix | Medium | |
| 2906 | Construct Product Matrix | Medium | |
| 3546 | Equal Sum Grid Partition I | Medium | |
| 1710 | Maximum Units on a Truck | Easy | |
| 2946 | Matrix Similarity After Cyclic Shifts | Easy | |
| 3548 | Equal Sum Grid Partition II | Hard | |
| 427 | Construct Quad Tree | Medium | |
| 2839 | Check if Strings Can be Made Equal With Operations I | Easy | |
| 2840 | Check if Strings Can be Made Equal With Operations II | Medium | |
| 3474 | Lexicographically Smallest Generated String | Hard | |
| 1876 | Substrings of Size Three with Distinct Characters | Easy | |
| 2751 | Robot Collisions | Hard | |
| 3418 | Maximum Amount of Money Robot Can Earn | Medium | |
| 3661 | Maximum Walls Destroyed by Robots | Hard | |
| 526 | Beautiful Arrangement | Medium | |
| 655 | Print Binary Tree | Medium | |
| 508 | Most Frequent Subtree Sum | Medium | |
| 1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | Medium | |
| 2215 | Find the Difference of Two Arrays | Easy | |
| 1320 | Minimum Distance to Type a Word Using Two Fingers | Hard | |
| 1052 | Grumpy Bookstore Owner | Medium | |
| 2515 | Shortest Distance to Target String in a Circular Array | Easy | |
| 3741 | Minimum Distance Between Three Equal Elements II | Medium | |
| 1160 | Find Words That Can Be Formed by Characters | Easy | |
| 3761 | Minimum Absolute Distance Between Mirror Pairs | Medium | |
| 1855 | Maximum Distance Between a Pair of Values | Medium | |
| 2661 | First Completely Painted Row or Column | Medium | |
| 2615 | Sum of Distances | Medium | |
| 937 | Reorder Data in Log Files | Medium | |
| 1559 | Detect Cycles in 2D Grid | Medium | |
| 3742 | Maximum Path Score in a Grid | Medium | |
| 1208 | Get Equal Substrings Within Budget | Medium | |
| 396 | Rotate Function | Medium | |
| 193 | Valid Phone Numbers | Easy | |
| 1979 | Find Greatest Common Divisor of Array | Easy | |
| 1928 | Minimum Cost to Reach Destination in Time | Hard | |
| 346 | Moving Average from Data Stream | Easy | |
| 2553 | Separate the Digits in an Array | Easy | |
| 2784 | Check if Array is Good | Easy | |
| 2879 | Display the First Three Rows | Easy | |
| 792 | Number of Matching Subsequences | Medium | |
| 2360 | Longest Cycle in a Graph | Hard | |
| 454 | 4Sum II | Medium | |
| 3300 | Minimum Element After Replacement With Digit Sum | Easy | |
| 377 | Combination Sum IV | Medium | |
| 1313 | Decompress Run-Length Encoded List | Easy | |
| 3161 | Block Placement Queries | Hard | |
| 3946 | Maximum Number of Items From Sale I | Medium | |
| 3753 | Total Waviness of Numbers in Range II | Hard | |
| 3509 | Maximum Product of Subsequences With an Alternating Sum Equal to K | Hard | |
| 2087 | Minimum Cost Homecoming of a Robot in a Grid | Medium | |
| 2940 | Find Building Where Alice and Bob Can Meet | Hard | |
| 3691 | Maximum Total Subarray Value II | Hard | |
| 2080 | Range Frequency Queries | Medium | |
| 1796 | Second Largest Digit in a String | Easy | |
| 3612 | Process String with Special Operations I | Medium | |
| 3668 | Restore Finishing Order | Easy | |
| 1036 | Escape a Large Maze | Hard | |
| 673 | Number of Longest Increasing Subsequence | Medium | |
| 2418 | Sort the People | Easy | |
| 390 | Elimination Game | Medium | |
| 1840 | Maximum Building Height | Hard | |
| 255 | Verify Preorder Sequence in Binary Search Tree | Medium | |
| 1833 | Maximum Ice Cream Bars | Medium | |
| 3699 | Number of ZigZag Arrays I | Hard | |
| 768 | Max Chunks To Make Sorted II | Hard | |
| 257 | Binary Tree Paths | Easy | |
| 3739 | Count Subarrays With Majority Element II | Hard | |
| 2627 | Debounce | Medium | |
| 3020 | Find the Maximum Number of Elements in Subset | Medium | |
| 1846 | Maximum Element After Decreasing and Rearranging | Medium | |
| 1967 | Number of Strings That Appear as Substrings in Word | Easy | |
| 1345 | Jump Game IV | Hard | |
| 2652 | Sum Multiples | Easy | |
| 1978 | Employees Whose Manager Left the Company | Easy | |
| 2812 | Find the Safest Path in a Grid | Medium | |
| 1312 | Minimum Insertion Steps to Make a String Palindrome | Hard | |
| 2063 | Vowels of All Substrings | Medium | |
| 3969 | Valid Subarrays With Matching Sum Digits I | Medium | |
| 1288 | Remove Covered Intervals | Medium | |
| 2621 | Sleep | Easy | |
| 2760 | Longest Even Odd Subarray With Threshold | Easy | |
| 3233 | Find the Count of Numbers Which Are Not Special | Medium | |
| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | |
| 726 | Number of Atoms | Hard | |
| 1697 | Checking Existence of Edge Length Limited Paths | Hard | |
| 3532 | Path Existence Queries in a Graph I | Medium | |
| 2887 | Fill Missing Data | Easy | |
| 2016 | Maximum Difference Between Increasing Elements | Easy | |
| 978 | Longest Turbulent Subarray | Medium |