| ID | Title | Acceptance | Difficulty | Frequency |
|---|
| 301 | Remove Invalid Parentheses | 43.3% | Hard | 5.575610 |
| 273 | Integer to English Words | 27.1% | Hard | 5.444753 |
| 953 | Verifying an Alien Dictionary | 54.1% | Easy | 5.313895 |
| 158 | Read N Characters Given Read4 II – Call multiple times | 33.8% | Hard | 5.183038 |
| 297 | Serialize and Deserialize Binary Tree | 47.5% | Hard | 5.090902 |
| 10 | Regular Expression Matching | 26.8% | Hard | 4.960045 |
| 91 | Decode Ways | 24.7% | Medium | 4.926071 |
| 253 | Meeting Rooms II | 45.7% | Medium | 4.890863 |
| 238 | Product of Array Except Self | 60.1% | Medium | 4.787304 |
| 680 | Valid Palindrome II | 36.6% | Easy | 4.727432 |
| 15 | 3Sum | 26.8% | Medium | 4.716880 |
| 560 | Subarray Sum Equals K | 43.9% | Medium | 4.681694 |
| 278 | First Bad Version | 35.7% | Easy | 4.667124 |
| 76 | Minimum Window Substring | 34.6% | Hard | 4.624844 |
| 973 | K Closest Points to Origin | 63.8% | Medium | 4.622683 |
| 67 | Add Binary | 45.2% | Easy | 4.590578 |
| 23 | Merge k Sorted Lists | 40.2% | Hard | 4.540902 |
| 283 | Move Zeroes | 57.8% | Easy | 4.539910 |
| 1249 | Minimum Remove to Make Valid Parentheses | 62.5% | Medium | 4.510651 |
| 125 | Valid Palindrome | 36.7% | Easy | 4.472291 |
| 29 | Divide Two Integers | 16.4% | Medium | 4.451722 |
| 31 | Next Permutation | 32.6% | Medium | 4.413309 |
| 173 | Binary Search Tree Iterator | 56.6% | Medium | 4.402058 |
| 282 | Expression Add Operators | 35.5% | Hard | 4.392818 |
| 211 | Add and Search Word – Data structure design | 38.1% | Medium | 4.323736 |
| 65 | Valid Number | 15.3% | Hard | 4.274687 |
| 157 | Read N Characters Given Read4 | 34.2% | Easy | 4.211806 |
| 124 | Binary Tree Maximum Path Sum | 34.3% | Hard | 4.173080 |
| 314 | Binary Tree Vertical Order Traversal | 45.3% | Medium | 4.169848 |
| 17 | Letter Combinations of a Phone Number | 46.8% | Medium | 4.164730 |
| 56 | Merge Intervals | 39.3% | Medium | 4.104801 |
| 426 | Convert Binary Search Tree to Sorted Doubly Linked List | 59.1% | Medium | 4.095652 |
| 269 | Alien Dictionary | 33.3% | Hard | 4.080562 |
| 1 | Two Sum | 45.6% | Easy | 4.011510 |
| 133 | Clone Graph | 34.8% | Medium | 3.996656 |
| 325 | Maximum Size Subarray Sum Equals k | 46.8% | Medium | 3.973800 |
| 438 | Find All Anagrams in a String | 43.3% | Medium | 3.960041 |
| 311 | Sparse Matrix Multiplication | 61.9% | Medium | 3.829184 |
| 415 | Add Strings | 47.5% | Easy | 3.823224 |
| 200 | Number of Islands | 46.8% | Medium | 3.817863 |
| 336 | Palindrome Pairs | 33.7% | Hard | 3.774867 |
| 215 | Kth Largest Element in an Array | 55.4% | Medium | 3.758613 |
| 543 | Diameter of Binary Tree | 48.4% | Easy | 3.717846 |
| 257 | Binary Tree Paths | 51.5% | Easy | 3.692630 |
| 523 | Continuous Subarray Sum | 24.6% | Medium | 3.683463 |
| 277 | Find the Celebrity | 41.8% | Medium | 3.616681 |
| 621 | Task Scheduler | 50.1% | Medium | 3.604547 |
| 43 | Multiply Strings | 33.9% | Medium | 3.592175 |
| 98 | Validate Binary Search Tree | 27.8% | Medium | 3.581806 |
| 42 | Trapping Rain Water | 48.9% | Hard | 3.577883 |
| 689 | Maximum Sum of 3 Non-Overlapping Subarrays | 46.3% | Hard | 3.558894 |
| 349 | Intersection of Two Arrays | 62.5% | Easy | 3.498653 |
| 340 | Longest Substring with At Most K Distinct Characters | 44.1% | Hard | 3.455560 |
| 121 | Best Time to Buy and Sell Stock | 50.5% | Easy | 3.423204 |
| 88 | Merge Sorted Array | 39.4% | Easy | 3.421005 |
| 114 | Flatten Binary Tree to Linked List | 49.3% | Medium | 3.392093 |
| 138 | Copy List with Random Pointer | 36.4% | Medium | 3.387316 |
| 636 | Exclusive Time of Functions | 51.9% | Medium | 3.383296 |
| 721 | Accounts Merge | 48.8% | Medium | 3.354594 |
| 161 | One Edit Distance | 32.3% | Medium | 3.353178 |
| 146 | LRU Cache | 33.2% | Medium | 3.347163 |
| 304 | Range Sum Query 2D – Immutable | 38.6% | Medium | 3.333446 |
| 199 | Binary Tree Right Side View | 54.1% | Medium | 3.304270 |
| 139 | Word Break | 40.1% | Medium | 3.292968 |
| 785 | Is Graph Bipartite? | 47.5% | Medium | 3.290263 |
| 33 | Search in Rotated Sorted Array | 34.5% | Medium | 3.159406 |
| 317 | Shortest Distance from All Buildings | 41.4% | Hard | 3.147697 |
| 143 | Reorder List | 37.1% | Medium | 3.070258 |
| 71 | Simplify Path | 32.6% | Medium | 3.048418 |
| 236 | Lowest Common Ancestor of a Binary Tree | 45.7% | Medium | 3.042833 |
| 286 | Walls and Gates | 54.5% | Medium | 3.033827 |
| 986 | Interval List Intersections | 67.3% | Medium | 3.008920 |
| 34 | Find First and Last Position of Element in Sorted Array | 36.2% | Medium | 2.986898 |
| 341 | Flatten Nested List Iterator | 52.9% | Medium | 2.856040 |
| 896 | Monotonic Array | 57.9% | Easy | 2.839535 |
| 398 | Random Pick Index | 56.0% | Medium | 2.813923 |
| 20 | Valid Parentheses | 39.0% | Easy | 2.802562 |
| 227 | Basic Calculator II | 36.9% | Medium | 2.763187 |
| 57 | Insert Interval | 33.5% | Hard | 2.733131 |
| 270 | Closest Binary Search Tree Value | 48.5% | Easy | 2.643427 |
| 350 | Intersection of Two Arrays II | 51.4% | Easy | 2.643329 |
| 360 | Sort Transformed Array | 48.8% | Medium | 2.515916 |
| 825 | Friends Of Appropriate Ages | 42.7% | Medium | 2.514882 |
| 358 | Rearrange String k Distance Apart | 34.9% | Hard | 2.506000 |
| 32 | Longest Valid Parentheses | 28.4% | Hard | 2.502485 |
| 78 | Subsets | 62.0% | Medium | 2.499447 |
| 247 | Strobogrammatic Number II | 47.6% | Medium | 2.481755 |
| 348 | Design Tic-Tac-Toe | 54.3% | Medium | 2.468847 |
| 708 | Insert into a Sorted Circular Linked List | 31.6% | Medium | 2.428601 |
| 339 | Nested List Weight Sum | 74.0% | Easy | 2.423518 |
| 51 | N-Queens | 46.6% | Hard | 2.353341 |
| 824 | Goat Latin | 63.4% | Easy | 2.335791 |
| 300 | Longest Increasing Subsequence | 42.6% | Medium | 2.311623 |
| 246 | Strobogrammatic Number | 45.0% | Easy | 2.303329 |
| 75 | Sort Colors | 47.3% | Medium | 2.263830 |
| 670 | Maximum Swap | 43.6% | Medium | 2.243417 |
| 958 | Check Completeness of a Binary Tree | 52.1% | Medium | 2.237122 |
| 380 | Insert Delete GetRandom O(1) | 47.5% | Medium | 2.230017 |
| 285 | Inorder Successor in BST | 40.4% | Medium | 2.214145 |
| 463 | Island Perimeter | 65.7% | Easy | 2.198933 |
| 938 | Range Sum of BST | 81.3% | Easy | 2.185626 |
| 987 | Vertical Order Traversal of a Binary Tree | 36.6% | Medium | 2.184699 |
| 224 | Basic Calculator | 36.8% | Hard | 2.157363 |
| 126 | Word Ladder II | 22.1% | Hard | 2.155302 |
| 109 | Convert Sorted List to Binary Search Tree | 47.7% | Medium | 2.123893 |
| 528 | Random Pick with Weight | 43.9% | Medium | 2.108026 |
| 53 | Maximum Subarray | 46.5% | Easy | 2.100797 |
| 162 | Find Peak Element | 43.3% | Medium | 2.097923 |
| 449 | Serialize and Deserialize BST | 52.0% | Medium | 2.073960 |
| 252 | Meeting Rooms | 54.6% | Easy | 2.056692 |
| 3 | Longest Substring Without Repeating Characters | 30.4% | Medium | 2.051763 |
| 498 | Diagonal Traverse | 48.2% | Medium | 2.043242 |
| 597 | Friend Requests I: Overall Acceptance Rate | 41.0% | Easy | 2.027359 |
| 13 | Roman to Integer | 55.7% | Easy | 2.014799 |
| 251 | Flatten 2D Vector | 45.7% | Medium | 1.972984 |
| 5 | Longest Palindromic Substring | 29.5% | Medium | 1.969953 |
| 127 | Word Ladder | 29.6% | Medium | 1.965842 |
| 1428 | Leftmost Column with at Least a One | 46.8% | Medium | 1.958770 |
| 791 | Custom Sort String | 65.7% | Medium | 1.950275 |
| 419 | Battleships in a Board | 70.0% | Medium | 1.932045 |
| 494 | Target Sum | 46.3% | Medium | 1.929245 |
| 239 | Sliding Window Maximum | 43.0% | Hard | 1.914143 |
| 772 | Basic Calculator III | 41.3% | Hard | 1.839615 |
| 8 | String to Integer (atoi) | 15.4% | Medium | 1.824849 |
| 305 | Number of Islands II | 40.1% | Hard | 1.794336 |
| 2 | Add Two Numbers | 33.9% | Medium | 1.779716 |
| 767 | Reorganize String | 48.7% | Medium | 1.763473 |
| 632 | Smallest Range Covering Elements from K Lists | 52.4% | Hard | 1.739983 |
| 381 | Insert Delete GetRandom O(1) – Duplicates allowed | 34.1% | Hard | 1.735473 |
| 206 | Reverse Linked List | 62.5% | Easy | 1.729697 |
| 602 | Friend Requests II: Who Has the Most Friends | 53.4% | Medium | 1.719118 |
| 393 | UTF-8 Validation | 37.5% | Medium | 1.712537 |
| 44 | Wildcard Matching | 24.7% | Hard | 1.699371 |
| 249 | Group Shifted Strings | 55.1% | Medium | 1.681514 |
| 308 | Range Sum Query 2D – Mutable | 35.6% | Hard | 1.679642 |
| 567 | Permutation in String | 44.4% | Medium | 1.677546 |
| 46 | Permutations | 63.5% | Medium | 1.672714 |
| 49 | Group Anagrams | 56.9% | Medium | 1.663409 |
| 921 | Minimum Add to Make Parentheses Valid | 73.7% | Medium | 1.657222 |
| 394 | Decode String | 50.0% | Medium | 1.639247 |
| 218 | The Skyline Problem | 34.6% | Hard | 1.615868 |
| 658 | Find K Closest Elements | 40.9% | Medium | 1.614283 |
| 432 | All O`one Data Structure | 32.4% | Hard | 1.611574 |
| 477 | Total Hamming Distance | 50.4% | Medium | 1.607779 |
| 647 | Palindromic Substrings | 60.6% | Medium | 1.604512 |
| 408 | Valid Word Abbreviation | 30.6% | Easy | 1.591893 |
| 4 | Median of Two Sorted Arrays | 29.6% | Hard | 1.584630 |
| 468 | Validate IP Address | 24.1% | Medium | 1.582769 |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | 48.8% | Medium | 1.571826 |
| 38 | Count and Say | 44.6% | Easy | 1.569507 |
| 21 | Merge Two Sorted Lists | 53.5% | Easy | 1.548247 |
| 230 | Kth Smallest Element in a BST | 60.2% | Medium | 1.539275 |
| 678 | Valid Parenthesis String | 31.0% | Medium | 1.523856 |
| 50 | Pow(x;n) | 30.3% | Medium | 1.521079 |
| 346 | Moving Average from Data Stream | 70.9% | Easy | 1.502690 |
| 1060 | Missing Element in Sorted Array | 54.5% | Medium | 1.492039 |
| 140 | Word Break II | 32.6% | Hard | 1.485288 |
| 1027 | Longest Arithmetic Sequence | 53.4% | Medium | 1.479854 |
| 22 | Generate Parentheses | 62.7% | Medium | 1.459844 |
| 128 | Longest Consecutive Sequence | 45.1% | Hard | 1.454551 |
| 622 | Design Circular Queue | 43.8% | Medium | 1.451817 |
| 378 | Kth Smallest Element in a Sorted Matrix | 54.3% | Medium | 1.431763 |
| 39 | Combination Sum | 56.1% | Medium | 1.426875 |
| 416 | Partition Equal Subset Sum | 43.7% | Medium | 1.422963 |
| 863 | All Nodes Distance K in Binary Tree | 55.4% | Medium | 1.415055 |
| 111 | Minimum Depth of Binary Tree | 37.4% | Easy | 1.403743 |
| 1197 | Minimum Knight Moves | 36.1% | Medium | 1.389867 |
| 674 | Longest Continuous Increasing Subsequence | 45.9% | Easy | 1.385694 |
| 25 | Reverse Nodes in k-Group | 42.1% | Hard | 1.377854 |
| 208 | Implement Trie (Prefix Tree) | 49.4% | Medium | 1.377162 |
| 102 | Binary Tree Level Order Traversal | 54.6% | Medium | 1.376540 |
| 1004 | Max Consecutive Ones III | 59.1% | Medium | 1.367279 |
| 489 | Robot Room Cleaner | 69.7% | Hard | 1.365847 |
| 93 | Restore IP Addresses | 35.6% | Medium | 1.354352 |
| 212 | Word Search II | 34.9% | Hard | 1.350476 |
| 18 | 4Sum | 33.7% | Medium | 1.350292 |
| 295 | Find Median from Data Stream | 44.3% | Hard | 1.326640 |
| 266 | Palindrome Permutation | 61.9% | Easy | 1.313084 |
| 332 | Reconstruct Itinerary | 36.7% | Medium | 1.312292 |
| 536 | Construct Binary Tree from String | 48.3% | Medium | 1.303707 |
| 192 | Word Frequency | 25.8% | Medium | 1.303174 |
| 329 | Longest Increasing Path in a Matrix | 43.4% | Hard | 1.293131 |
| 79 | Word Search | 35.6% | Medium | 1.280808 |
| 209 | Minimum Size Subarray Sum | 38.2% | Medium | 1.277501 |
| 766 | Toeplitz Matrix | 65.1% | Easy | 1.265045 |
| 865 | Smallest Subtree with all the Deepest Nodes | 60.8% | Medium | 1.261481 |
| 334 | Increasing Triplet Subsequence | 40.0% | Medium | 1.261110 |
| 642 | Design Search Autocomplete System | 44.7% | Hard | 1.250387 |
| 490 | The Maze | 51.4% | Medium | 1.242540 |
| 319 | Bulb Switcher | 45.4% | Medium | 1.239690 |
| 452 | Minimum Number of Arrows to Burst Balloons | 49.6% | Medium | 1.230615 |
| 117 | Populating Next Right Pointers in Each Node II | 39.1% | Medium | 1.226231 |
| 123 | Best Time to Buy and Sell Stock III | 37.5% | Hard | 1.218197 |
| 403 | Frog Jump | 39.7% | Hard | 1.215008 |
| 122 | Best Time to Buy and Sell Stock II | 57.0% | Easy | 1.211854 |
| 240 | Search a 2D Matrix II | 43.2% | Medium | 1.203306 |
| 1123 | Lowest Common Ancestor of Deepest Leaves | 66.8% | Medium | 1.196994 |
| 28 | Implement strStr() | 34.5% | Easy | 1.186556 |
| 529 | Minesweeper | 59.1% | Medium | 1.168509 |
| 347 | Top K Frequent Elements | 61.2% | Medium | 1.164325 |
| 692 | Top K Frequent Words | 51.8% | Medium | 1.156978 |
| 885 | Spiral Matrix III | 69.4% | Medium | 1.153571 |
| 695 | Max Area of Island | 62.7% | Medium | 1.149836 |
| 399 | Evaluate Division | 51.6% | Medium | 1.149791 |
| 73 | Set Matrix Zeroes | 43.1% | Medium | 1.149283 |
| 92 | Reverse Linked List II | 38.8% | Medium | 1.116618 |
| 116 | Populating Next Right Pointers in Each Node | 45.2% | Medium | 1.100206 |
| 568 | Maximum Vacation Days | 40.8% | Hard | 1.094922 |
| 480 | Sliding Window Median | 37.2% | Hard | 1.074891 |
| 207 | Course Schedule | 43.1% | Medium | 1.062038 |
| 62 | Unique Paths | 54.1% | Medium | 1.048269 |
| 81 | Search in Rotated Sorted Array II | 33.0% | Medium | 1.042801 |
| 166 | Fraction to Recurring Decimal | 21.6% | Medium | 1.042800 |
| 540 | Single Element in a Sorted Array | 57.9% | Medium | 1.011865 |
| 548 | Split Array with Equal Sum | 46.4% | Medium | 1.004832 |
| 54 | Spiral Matrix | 34.1% | Medium | 0.990908 |
| 616 | Add Bold Tag in String | 43.1% | Medium | 0.987768 |
| 694 | Number of Distinct Islands | 56.0% | Medium | 0.968250 |
| 11 | Container With Most Water | 50.8% | Medium | 0.965201 |
| 691 | Stickers to Spell Word | 42.9% | Hard | 0.964462 |
| 235 | Lowest Common Ancestor of a Binary Search Tree | 49.9% | Easy | 0.962090 |
| 30 | Substring with Concatenation of All Words | 25.4% | Hard | 0.959762 |
| 400 | Nth Digit | 31.7% | Medium | 0.955511 |
| 428 | Serialize and Deserialize N-ary Tree | 59.4% | Hard | 0.948672 |
| 333 | Largest BST Subtree | 35.8% | Medium | 0.940031 |
| 934 | Shortest Bridge | 48.2% | Medium | 0.936831 |
| 844 | Backspace String Compare | 46.4% | Easy | 0.926408 |
| 24 | Swap Nodes in Pairs | 50.4% | Medium | 0.916072 |
| 99 | Recover Binary Search Tree | 39.7% | Hard | 0.914769 |
| 549 | Binary Tree Longest Consecutive Sequence II | 47.0% | Medium | 0.906100 |
| 1026 | Maximum Difference Between Node and Ancestor | 66.0% | Medium | 0.903004 |
| 296 | Best Meeting Point | 57.5% | Hard | 0.897721 |
| 1113 | Reported Posts | 64.1% | Easy | 0.887303 |
| 90 | Subsets II | 47.1% | Medium | 0.870794 |
| 935 | Knight Dialer | 45.2% | Medium | 0.864997 |
| 68 | Text Justification | 27.7% | Hard | 0.864370 |
| 298 | Binary Tree Longest Consecutive Sequence | 47.1% | Medium | 0.860201 |
| 364 | Nested List Weight Sum II | 62.8% | Medium | 0.855767 |
| 74 | Search a 2D Matrix | 36.5% | Medium | 0.855044 |
| 280 | Wiggle Sort | 63.8% | Medium | 0.853964 |
| 85 | Maximal Rectangle | 37.7% | Hard | 0.851125 |
| 554 | Brick Wall | 50.0% | Medium | 0.848711 |
| 72 | Edit Distance | 44.8% | Hard | 0.846506 |
| 37 | Sudoku Solver | 43.6% | Hard | 0.845063 |
| 163 | Missing Ranges | 24.3% | Medium | 0.843930 |
| 387 | First Unique Character in a String | 53.4% | Easy | 0.826134 |
| 129 | Sum Root to Leaf Numbers | 49.1% | Medium | 0.825074 |
| 145 | Binary Tree Postorder Traversal | 55.0% | Hard | 0.821870 |
| 1216 | Valid Palindrome III | 47.8% | Hard | 0.818724 |
| 977 | Squares of a Sorted Array | 72.1% | Easy | 0.816761 |
| 148 | Sort List | 42.3% | Medium | 0.807481 |
| 405 | Convert a Number to Hexadecimal | 43.9% | Easy | 0.806099 |
| 639 | Decode Ways II | 26.6% | Hard | 0.803408 |
| 69 | Sqrt(x) | 33.9% | Easy | 0.801508 |
| 94 | Binary Tree Inorder Traversal | 63.3% | Medium | 0.794458 |
| 84 | Largest Rectangle in Histogram | 35.2% | Hard | 0.790965 |
| 939 | Minimum Area Rectangle | 51.8% | Medium | 0.775869 |
| 272 | Closest Binary Search Tree Value II | 50.5% | Hard | 0.766834 |
| 839 | Similar String Groups | 38.6% | Hard | 0.761200 |
| 963 | Minimum Area Rectangle II | 50.9% | Medium | 0.756695 |
| 614 | Second Degree Follower | 30.3% | Medium | 0.734323 |
| 26 | Remove Duplicates from Sorted Array | 45.1% | Easy | 0.731726 |
| 430 | Flatten a Multilevel Doubly Linked List | 55.1% | Medium | 0.722922 |
| 395 | Longest Substring with At Least K Repeating Characters | 41.4% | Medium | 0.711072 |
| 291 | Word Pattern II | 43.4% | Hard | 0.705886 |
| 1094 | Car Pooling | 56.7% | Medium | 0.705367 |
| 191 | Number of 1 Bits | 49.8% | Easy | 0.689107 |
| 322 | Coin Change | 35.5% | Medium | 0.678094 |
| 556 | Next Greater Element III | 31.7% | Medium | 0.678063 |
| 323 | Number of Connected Components in an Undirected Graph | 56.0% | Medium | 0.675447 |
| 363 | Max Sum of Rectangle No Larger Than K | 37.3% | Hard | 0.663876 |
| 242 | Valid Anagram | 56.9% | Easy | 0.660945 |
| 41 | First Missing Positive | 32.0% | Hard | 0.655545 |
| 445 | Add Two Numbers II | 54.5% | Medium | 0.639958 |
| 724 | Find Pivot Index | 44.0% | Easy | 0.637955 |
| 1269 | Number of Ways to Stay in the Same Place After Some Steps | 43.2% | Hard | 0.605085 |
| 152 | Maximum Product Subarray | 31.7% | Medium | 0.591827 |
| 518 | Coin Change 2 | 50.2% | Medium | 0.591561 |
| 137 | Single Number II | 52.4% | Medium | 0.591561 |
| 969 | Pancake Sorting | 67.5% | Medium | 0.590578 |
| 36 | Valid Sudoku | 48.7% | Medium | 0.589525 |
| 160 | Intersection of Two Linked Lists | 40.6% | Easy | 0.569689 |
| 637 | Average of Levels in Binary Tree | 63.1% | Easy | 0.560823 |
| 875 | Koko Eating Bananas | 52.1% | Medium | 0.554895 |
| 19 | Remove Nth Node From End of List | 35.2% | Medium | 0.554032 |
| 742 | Closest Leaf in a Binary Tree | 43.6% | Medium | 0.548695 |
| 214 | Shortest Palindrome | 29.8% | Hard | 0.533182 |
| 47 | Permutations II | 46.4% | Medium | 0.531985 |
| 45 | Jump Game II | 30.6% | Hard | 0.526529 |
| 248 | Strobogrammatic Number III | 39.6% | Hard | 0.513806 |
| 55 | Jump Game | 34.6% | Medium | 0.510372 |
| 1242 | Web Crawler Multithreaded | 45.9% | Medium | 0.497838 |
| 284 | Peeking Iterator | 45.7% | Medium | 0.494580 |
| 316 | Remove Duplicate Letters | 35.8% | Hard | 0.486102 |
| 101 | Symmetric Tree | 46.8% | Easy | 0.483504 |
| 12 | Integer to Roman | 55.1% | Medium | 0.481875 |
| 40 | Combination Sum II | 48.2% | Medium | 0.479939 |
| 388 | Longest Absolute File Path | 41.8% | Medium | 0.475423 |
| 352 | Data Stream as Disjoint Intervals | 47.3% | Hard | 0.475160 |
| 14 | Longest Common Prefix | 35.4% | Easy | 0.473831 |
| 1142 | User Activity for the Past 30 Days II | 34.5% | Easy | 0.469379 |
| 66 | Plus One | 43.0% | Easy | 0.467181 |
| 443 | String Compression | 41.3% | Easy | 0.464825 |
| 1132 | Reported Posts II | 34.4% | Medium | 0.464373 |
| 153 | Find Minimum in Rotated Sorted Array | 45.1% | Medium | 0.462449 |
| 515 | Find Largest Value in Each Tree Row | 61.1% | Medium | 0.459405 |
| 1213 | Intersection of Three Sorted Arrays | 78.9% | Easy | 0.457784 |
| 223 | Rectangle Area | 37.8% | Medium | 0.455188 |
| 1008 | Construct Binary Search Tree from Preorder Traversal | 78.4% | Medium | 0.446640 |
| 63 | Unique Paths II | 34.6% | Medium | 0.444719 |
| 108 | Convert Sorted Array to Binary Search Tree | 57.9% | Easy | 0.442727 |
| 564 | Find the Closest Palindrome | 19.7% | Hard | 0.437122 |
| 491 | Increasing Subsequences | 46.1% | Medium | 0.433719 |
| 189 | Rotate Array | 34.7% | Easy | 0.427891 |
| 77 | Combinations | 54.7% | Medium | 0.427636 |
| 1233 | Remove Sub-Folders from the Filesystem | 59.5% | Medium | 0.424374 |
| 437 | Path Sum III | 47.2% | Medium | 0.415783 |
| 392 | Is Subsequence | 49.2% | Easy | 0.414478 |
| 48 | Rotate Image | 56.7% | Medium | 0.412676 |
| 151 | Reverse Words in a String | 21.9% | Medium | 0.404490 |
| 776 | Split BST | 55.8% | Medium | 0.401341 |
| 1264 | Page Recommendations | 67.6% | Medium | 0.399311 |
| 688 | Knight Probability in Chessboard | 48.9% | Medium | 0.389778 |
| 1424 | Diagonal Traverse II | 42.4% | Medium | 0.387343 |
| 136 | Single Number | 65.5% | Easy | 0.370891 |
| 7 | Reverse Integer | 25.8% | Easy | 0.369893 |
| 167 | Two Sum II – Input array is sorted | 54.1% | Easy | 0.369719 |
| 547 | Friend Circles | 58.6% | Medium | 0.366683 |
| 407 | Trapping Rain Water II | 42.4% | Hard | 0.366211 |
| 150 | Evaluate Reverse Polish Notation | 36.3% | Medium | 0.358097 |
| 1032 | Stream of Characters | 48.3% | Hard | 0.357361 |
| 345 | Reverse Vowels of a String | 44.2% | Easy | 0.354073 |
| 703 | Kth Largest Element in a Stream | 49.7% | Easy | 0.353029 |
| 442 | Find All Duplicates in an Array | 67.8% | Medium | 0.352615 |
| 862 | Shortest Subarray with Sum at Least K | 24.6% | Hard | 0.344706 |
| 855 | Exam Room | 43.1% | Medium | 0.344429 |
| 303 | Range Sum Query – Immutable | 44.7% | Easy | 0.338754 |
| 435 | Non-overlapping Intervals | 42.9% | Medium | 0.334927 |
| 110 | Balanced Binary Tree | 43.5% | Easy | 0.334101 |
| 1091 | Shortest Path in Binary Matrix | 38.2% | Medium | 0.332098 |
| 228 | Summary Ranges | 39.5% | Medium | 0.331418 |
| 827 | Making A Large Island | 45.7% | Hard | 0.328795 |
| 794 | Valid Tic-Tac-Toe State | 32.6% | Medium | 0.326763 |
| 384 | Shuffle an Array | 52.8% | Medium | 0.325102 |
| 852 | Peak Index in a Mountain Array | 71.6% | Easy | 0.325069 |
| 918 | Maximum Sum Circular Subarray | 33.7% | Medium | 0.315917 |
| 16 | 3Sum Closest | 46.0% | Medium | 0.314927 |
| 104 | Maximum Depth of Binary Tree | 66.0% | Easy | 0.314231 |
| 686 | Repeated String Match | 32.3% | Easy | 0.311779 |
| 478 | Generate Random Point in a Circle | 38.5% | Medium | 0.308547 |
| 324 | Wiggle Sort II | 29.9% | Medium | 0.307700 |
| 112 | Path Sum | 41.2% | Easy | 0.300860 |
| 1245 | Tree Diameter | 60.1% | Medium | 0.298492 |
| 936 | Stamping The Sequence | 42.8% | Hard | 0.297251 |
| 641 | Design Circular Deque | 52.7% | Medium | 0.295714 |
| 155 | Min Stack | 44.5% | Easy | 0.295594 |
| 171 | Excel Sheet Column Number | 55.9% | Easy | 0.293085 |
| 377 | Combination Sum IV | 45.3% | Medium | 0.290841 |
| 60 | Permutation Sequence | 38.4% | Hard | 0.285870 |
| 662 | Maximum Width of Binary Tree | 41.0% | Medium | 0.283809 |
| 382 | Linked List Random Node | 52.1% | Medium | 0.280215 |
| 730 | Count Different Palindromic Subsequences | 41.8% | Hard | 0.274436 |
| 414 | Third Maximum Number | 30.5% | Easy | 0.273791 |
| 759 | Employee Free Time | 66.3% | Hard | 0.271043 |
| 983 | Minimum Cost For Tickets | 60.5% | Medium | 0.267013 |
| 450 | Delete Node in a BST | 43.1% | Medium | 0.261860 |
| 210 | Course Schedule II | 40.7% | Medium | 0.261220 |
| 505 | The Maze II | 47.7% | Medium | 0.259088 |
| 663 | Equal Tree Partition | 39.5% | Medium | 0.257829 |
| 234 | Palindrome Linked List | 39.3% | Easy | 0.255269 |
| 446 | Arithmetic Slices II – Subsequence | 32.7% | Hard | 0.254168 |
| 609 | Find Duplicate File in System | 59.5% | Medium | 0.253880 |
| 168 | Excel Sheet Column Title | 31.1% | Easy | 0.246832 |
| 307 | Range Sum Query – Mutable | 34.6% | Medium | 0.243287 |
| 716 | Max Stack | 42.6% | Easy | 0.241084 |
| 188 | Best Time to Buy and Sell Stock IV | 28.0% | Hard | 0.236213 |
| 655 | Print Binary Tree | 55.0% | Medium | 0.235456 |
| 344 | Reverse String | 68.5% | Easy | 0.235285 |
| 654 | Maximum Binary Tree | 79.9% | Medium | 0.227195 |
| 221 | Maximal Square | 37.7% | Medium | 0.221851 |
| 159 | Longest Substring with At Most Two Distinct Characters | 49.4% | Medium | 0.221489 |
| 241 | Different Ways to Add Parentheses | 55.2% | Medium | 0.220965 |
| 750 | Number Of Corner Rectangles | 66.4% | Medium | 0.220671 |
| 516 | Longest Palindromic Subsequence | 53.2% | Medium | 0.215669 |
| 417 | Pacific Atlantic Water Flow | 41.1% | Medium | 0.212561 |
| 669 | Trim a Binary Search Tree | 63.0% | Easy | 0.212458 |
| 410 | Split Array Largest Sum | 44.5% | Hard | 0.211309 |
| 261 | Graph Valid Tree | 42.2% | Medium | 0.210683 |
| 6 | ZigZag Conversion | 36.3% | Medium | 0.210405 |
| 503 | Next Greater Element II | 56.5% | Medium | 0.209630 |
| 312 | Burst Balloons | 51.8% | Hard | 0.209213 |
| 1053 | Previous Permutation With One Swap | 48.5% | Medium | 0.209091 |
| 315 | Count of Smaller Numbers After Self | 41.5% | Hard | 0.208068 |
| 884 | Uncommon Words from Two Sentences | 63.3% | Easy | 0.207870 |
| 290 | Word Pattern | 37.0% | Easy | 0.204966 |
| 371 | Sum of Two Integers | 50.7% | Medium | 0.204269 |
| 752 | Open the Lock | 51.8% | Medium | 0.202140 |
| 578 | Get Highest Answer Rate Question | 39.3% | Medium | 0.201572 |
| 714 | Best Time to Buy and Sell Stock with Transaction Fee | 54.7% | Medium | 0.199665 |
| 886 | Possible Bipartition | 44.2% | Medium | 0.196245 |
| 496 | Next Greater Element I | 63.8% | Easy | 0.192787 |
| 178 | Rank Scores | 45.8% | Medium | 0.188439 |
| 681 | Next Closest Time | 45.0% | Medium | 0.188126 |
| 103 | Binary Tree Zigzag Level Order Traversal | 48.3% | Medium | 0.188054 |
| 981 | Time Based Key-Value Store | 53.1% | Medium | 0.184476 |
| 889 | Construct Binary Tree from Preorder and Postorder Traversal | 66.2% | Medium | 0.183158 |
| 593 | Valid Square | 43.1% | Medium | 0.181905 |
| 916 | Word Subsets | 47.8% | Medium | 0.181583 |
| 9 | Palindrome Number | 48.4% | Easy | 0.177912 |
| 130 | Surrounded Regions | 28.1% | Medium | 0.176133 |
| 328 | Odd Even Linked List | 55.7% | Medium | 0.175488 |
| 843 | Guess the Word | 46.1% | Hard | 0.170625 |
| 413 | Arithmetic Slices | 57.9% | Medium | 0.165722 |
| 535 | Encode and Decode TinyURL | 79.9% | Medium | 0.158276 |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | 47.2% | Medium | 0.156399 |
| 373 | Find K Pairs with Smallest Sums | 36.7% | Medium | 0.153865 |
| 676 | Implement Magic Dictionary | 54.5% | Medium | 0.151040 |
| 723 | Candy Crush | 69.2% | Medium | 0.147566 |
| 113 | Path Sum II | 46.7% | Medium | 0.146111 |
| 95 | Unique Binary Search Trees II | 40.6% | Medium | 0.142363 |
| 172 | Factorial Trailing Zeroes | 37.8% | Easy | 0.141445 |
| 176 | Second Highest Salary | 31.6% | Easy | 0.140003 |
| 250 | Count Univalue Subtrees | 52.0% | Medium | 0.137674 |
| 1209 | Remove All Adjacent Duplicates in String II | 56.9% | Medium | 0.137125 |
| 1043 | Partition Array for Maximum Sum | 65.2% | Medium | 0.136368 |
| 204 | Count Primes | 31.5% | Easy | 0.134285 |
| 100 | Same Tree | 53.4% | Easy | 0.131817 |
| 226 | Invert Binary Tree | 65.0% | Easy | 0.129345 |
| 274 | H-Index | 36.1% | Medium | 0.128278 |
| 338 | Counting Bits | 69.5% | Medium | 0.125806 |
| 461 | Hamming Distance | 72.8% | Easy | 0.125704 |
| 1146 | Snapshot Array | 37.0% | Medium | 0.121545 |
| 572 | Subtree of Another Tree | 44.1% | Easy | 0.121105 |
| 222 | Count Complete Tree Nodes | 46.8% | Medium | 0.119584 |
| 848 | Shifting Letters | 44.6% | Medium | 0.119188 |
| 1439 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | 59.5% | Hard | 0.119188 |
| 179 | Largest Number | 28.8% | Medium | 0.118364 |
| 525 | Contiguous Array | 42.8% | Medium | 0.117505 |
| 268 | Missing Number | 51.7% | Easy | 0.115388 |
| 1275 | Find Winner on a Tic Tac Toe Game | 52.8% | Easy | 0.115364 |
| 61 | Rotate List | 30.0% | Medium | 0.115286 |
| 1047 | Remove All Adjacent Duplicates In String | 68.6% | Easy | 0.111813 |
| 265 | Paint House II | 44.6% | Hard | 0.108802 |
| 792 | Number of Matching Subsequences | 47.4% | Medium | 0.108671 |
| 181 | Employees Earning More Than Their Managers | 56.9% | Easy | 0.108213 |
| 279 | Perfect Squares | 47.4% | Medium | 0.107441 |
| 966 | Vowel Spellchecker | 47.2% | Medium | 0.106767 |
| 70 | Climbing Stairs | 47.8% | Easy | 0.103520 |
| 773 | Sliding Puzzle | 59.3% | Hard | 0.102947 |
| 118 | Pascal’s Triangle | 52.5% | Easy | 0.102885 |
| 1379 | Find a Corresponding Node of a Binary Tree in a Clone of That Tree | 83.8% | Medium | 0.101869 |
| 1411 | Number of Ways to Paint N × 3 Grid | 61.1% | Hard | 0.101352 |
| 402 | Remove K Digits | 28.4% | Medium | 0.101014 |
| 141 | Linked List Cycle | 41.1% | Easy | 0.100633 |
| 628 | Maximum Product of Three Numbers | 47.1% | Easy | 0.099090 |
| 1141 | User Activity for the Past 30 Days I | 54.1% | Easy | 0.096460 |
| 59 | Spiral Matrix II | 53.9% | Medium | 0.094839 |
| 821 | Shortest Distance to a Character | 66.9% | Easy | 0.094508 |
| 1062 | Longest Repeating Substring | 57.2% | Medium | 0.092018 |
| 1077 | Project Employees III | 75.6% | Medium | 0.090765 |
| 1241 | Number of Comments per Post | 67.0% | Easy | 0.089145 |
| 652 | Find Duplicate Subtrees | 50.2% | Medium | 0.089079 |
| 995 | Minimum Number of K Consecutive Bit Flips | 46.8% | Hard | 0.088947 |
| 788 | Rotated Digits | 57.1% | Easy | 0.087434 |
| 1108 | Defanging an IP Address | 87.5% | Easy | 0.086321 |
| 287 | Find the Duplicate Number | 55.5% | Medium | 0.084583 |
| 1019 | Next Greater Node In Linked List | 57.4% | Medium | 0.083730 |
| 550 | Game Play Analysis IV | 45.3% | Medium | 0.082863 |
| 962 | Maximum Width Ramp | 45.4% | Medium | 0.081845 |
| 698 | Partition to K Equal Sum Subsets | 45.0% | Medium | 0.081845 |
| 887 | Super Egg Drop | 27.1% | Hard | 0.080544 |
| 673 | Number of Longest Increasing Subsequence | 35.7% | Medium | 0.080256 |
| 1003 | Check If Word Is Valid After Substitutions | 55.3% | Medium | 0.078471 |
| 1254 | Number of Closed Islands | 60.5% | Medium | 0.077961 |
| 1055 | Shortest Way to Form String | 56.9% | Medium | 0.076813 |
| 778 | Swim in Rising Water | 53.1% | Hard | 0.076519 |
| 229 | Majority Element II | 35.6% | Medium | 0.074142 |
| 787 | Cheapest Flights Within K Stops | 39.3% | Medium | 0.073259 |
| 1287 | Element Appearing More Than 25% In Sorted Array | 60.2% | Easy | 0.072847 |
| 1057 | Campus Bikes | 57.7% | Medium | 0.071077 |
| 289 | Game of Life | 54.5% | Medium | 0.067564 |
| 997 | Find the Town Judge | 50.1% | Easy | 0.065489 |
| 726 | Number of Atoms | 49.0% | Hard | 0.063715 |
| 509 | Fibonacci Number | 67.2% | Easy | 0.062271 |
| 472 | Concatenated Words | 43.7% | Hard | 0.061201 |
| 353 | Design Snake Game | 34.2% | Medium | 0.060532 |
| 1445 | Apples & Oranges | 87.1% | Medium | 0.059541 |
| 217 | Contains Duplicate | 56.0% | Easy | 0.059101 |
| 1305 | All Elements in Two Binary Search Trees | 76.1% | Medium | 0.058193 |
| 979 | Distribute Coins in Binary Tree | 68.9% | Medium | 0.058005 |
| 83 | Remove Duplicates from Sorted List | 45.4% | Easy | 0.055776 |
| 653 | Two Sum IV – Input is a BST | 55.5% | Easy | 0.055724 |
| 202 | Happy Number | 50.4% | Easy | 0.055034 |
| 310 | Minimum Height Trees | 32.3% | Medium | 0.054230 |
| 679 | 24 Game | 46.4% | Hard | 0.053417 |
| 203 | Remove Linked List Elements | 38.6% | Easy | 0.047987 |
| 205 | Isomorphic Strings | 39.8% | Easy | 0.045397 |
| 733 | Flood Fill | 55.3% | Easy | 0.044132 |
| 1498 | Number of Subsequences That Satisfy the Given Sum Condition | 36.7% | Medium | 0.043343 |
| 611 | Valid Triangle Number | 48.4% | Medium | 0.042559 |
| 1219 | Path with Maximum Gold | 65.1% | Medium | 0.041115 |
| 260 | Single Number III | 64.3% | Medium | 0.040301 |
| 739 | Daily Temperatures | 63.3% | Medium | 0.039540 |
| 406 | Queue Reconstruction by Height | 66.9% | Medium | 0.039496 |
| 706 | Design HashMap | 61.3% | Easy | 0.039016 |
| 872 | Leaf-Similar Trees | 64.5% | Easy | 0.038999 |
| 993 | Cousins in Binary Tree | 52.0% | Easy | 0.038764 |
| 337 | House Robber III | 50.6% | Medium | 0.038253 |
| 905 | Sort Array By Parity | 74.1% | Easy | 0.037874 |
| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | 57.9% | Medium | 0.037110 |
| 646 | Maximum Length of Pair Chain | 51.9% | Medium | 0.036870 |
| 376 | Wiggle Subsequence | 39.6% | Medium | 0.036667 |
| 96 | Unique Binary Search Trees | 52.9% | Medium | 0.036467 |
| 701 | Insert into a Binary Search Tree | 77.7% | Medium | 0.034592 |
| 309 | Best Time to Buy and Sell Stock with Cooldown | 47.4% | Medium | 0.034362 |
| 1360 | Number of Days Between Two Dates | 48.8% | Easy | 0.034016 |
| 154 | Find Minimum in Rotated Sorted Array II | 41.6% | Hard | 0.033505 |
| 80 | Remove Duplicates from Sorted Array II | 44.0% | Medium | 0.033030 |
| 832 | Flipping an Image | 76.2% | Easy | 0.032670 |
| 605 | Can Place Flowers | 31.6% | Easy | 0.024571 |
| 64 | Minimum Path Sum | 54.5% | Medium | 0.024287 |
| 1137 | N-th Tribonacci Number | 55.9% | Easy | 0.020726 |
| 237 | Delete Node in a Linked List | 63.8% | Easy | 0.020421 |
| 1266 | Minimum Time Visiting All Points | 79.6% | Easy | 0.017354 |
| 1021 | Remove Outermost Parentheses | 78.0% | Easy | 0.016434 |
| 771 | Jewels and Stones | 86.4% | Easy | 0.016316 |
| 1304 | Find N Unique Integers Sum up to Zero | 76.3% | Easy | 0.015892 |
| 404 | Sum of Left Leaves | 50.9% | Easy | 0.013981 |
| 451 | Sort Characters By Frequency | 63.0% | Medium | 0.013153 |
| 1143 | Longest Common Subsequence | 58.4% | Medium | 0.008835 |
| 763 | Partition Labels | 76.1% | Medium | 0.008385 |
| 1528 | Shuffle String | 86.1% | Easy | 0.006295 |
| 275 | H-Index II | 36.0% | Medium | 0 |
| 745 | Prefix and Suffix Search | 34.1% | Hard | 0 |
| 764 | Largest Plus Sign | 46.0% | Medium | 0 |
| 784 | Letter Case Permutation | 64.6% | Medium | 0 |
| 801 | Minimum Swaps To Make Sequences Increasing | 38.9% | Medium | 0 |
| 893 | Groups of Special-Equivalent Strings | 66.5% | Easy | 0 |
| 968 | Binary Tree Cameras | 37.5% | Hard | 0 |
| 989 | Add to Array-Form of Integer | 44.2% | Easy | 0 |
| 998 | Maximum Binary Tree II | 63.0% | Medium | 0 |
| 1033 | Moving Stones Until Consecutive | 41.7% | Easy | 0 |
| 1040 | Moving Stones Until Consecutive II | 52.9% | Medium | 0 |
| 1075 | Project Employees I | 64.8% | Easy | 0 |
| 1076 | Project Employees II | 53.7% | Easy | 0 |
| 1361 | Validate Binary Tree Nodes | 48.5% | Medium | 0 |
| 1211 | Queries Quality and Percentage | 68.3% | Easy | 0 |
| 1225 | Report Contiguous Dates | 61.1% | Hard | 0 |
| 1236 | Web Crawler | 64.3% | Medium | 0 |
| 1322 | Ads Performance | 57.8% | Easy | 0 |
| 1357 | Apply Discount Every n Orders | 66.0% | Medium | 0 |
| 1398 | Customers Who Bought Products A and B but Not C | 80.7% | Medium | 0 |
| 1443 | Minimum Time to Collect All Apples in a Tree | 55.4% | Medium | 0 |
| 1460 | Make Two Arrays Equal by Reversing Sub-arrays | 73.9% | Easy | 0 |
| 1453 | Maximum Number of Darts Inside of a Circular Dartboard | 33.7% | Hard | 0 |
| 1522 | Diameter of N-Ary Tree | 70.0% | Medium | 0 |
