| ID | Title | Acceptance | Difficulty | Frequency |
|---|
| 244 | Shortest Word Distance II | 52.3% | Medium | 6.080030 |
| 364 | Nested List Weight Sum II | 62.8% | Medium | 5.858903 |
| 170 | Two Sum III – Data structure design | 33.5% | Easy | 5.339976 |
| 339 | Nested List Weight Sum | 74.0% | Easy | 4.821050 |
| 272 | Closest Binary Search Tree Value II | 50.5% | Hard | 4.698660 |
| 156 | Binary Tree Upside Down | 55.0% | Medium | 4.677621 |
| 716 | Max Stack | 42.6% | Easy | 4.158695 |
| 254 | Factor Combinations | 46.7% | Medium | 4.042679 |
| 243 | Shortest Word Distance | 61.0% | Easy | 4.033402 |
| 366 | Find Leaves of Binary Tree | 70.6% | Medium | 3.887404 |
| 256 | Paint House | 52.1% | Easy | 3.830168 |
| 265 | Paint House II | 44.6% | Hard | 3.643918 |
| 149 | Max Points on a Line | 16.9% | Hard | 3.593946 |
| 65 | Valid Number | 15.3% | Hard | 3.485942 |
| 605 | Can Place Flowers | 31.6% | Easy | 3.393038 |
| 380 | Insert Delete GetRandom O(1) | 47.5% | Medium | 3.226132 |
| 432 | All O`one Data Structure | 32.4% | Hard | 3.182278 |
| 68 | Text Justification | 27.7% | Hard | 3.168342 |
| 341 | Flatten Nested List Iterator | 52.9% | Medium | 2.856040 |
| 150 | Evaluate Reverse Polish Notation | 36.3% | Medium | 2.745764 |
| 205 | Isomorphic Strings | 39.8% | Easy | 2.668779 |
| 245 | Shortest Word Distance III | 55.3% | Medium | 2.480477 |
| 297 | Serialize and Deserialize Binary Tree | 47.5% | Hard | 2.420873 |
| 261 | Graph Valid Tree | 42.2% | Medium | 2.361420 |
| 611 | Valid Triangle Number | 48.4% | Medium | 2.316616 |
| 730 | Count Different Palindromic Subsequences | 41.8% | Hard | 2.300829 |
| 53 | Maximum Subarray | 46.5% | Easy | 2.234231 |
| 187 | Repeated DNA Sequences | 38.9% | Medium | 2.103432 |
| 698 | Partition to K Equal Sum Subsets | 45.0% | Medium | 2.018875 |
| 152 | Maximum Product Subarray | 31.7% | Medium | 2.012330 |
| 72 | Edit Distance | 44.8% | Hard | 1.770347 |
| 200 | Number of Islands | 46.8% | Medium | 1.748639 |
| 277 | Find the Celebrity | 41.8% | Medium | 1.675341 |
| 56 | Merge Intervals | 39.3% | Medium | 1.660437 |
| 516 | Longest Palindromic Subsequence | 53.2% | Medium | 1.628362 |
| 671 | Second Minimum Node In a Binary Tree | 42.7% | Easy | 1.603715 |
| 76 | Minimum Window Substring | 34.6% | Hard | 1.590634 |
| 464 | Can I Win | 28.8% | Medium | 1.506328 |
| 236 | Lowest Common Ancestor of a Binary Tree | 45.7% | Medium | 1.491728 |
| 12 | Integer to Roman | 55.1% | Medium | 1.487855 |
| 373 | Find K Pairs with Smallest Sums | 36.7% | Medium | 1.439888 |
| 235 | Lowest Common Ancestor of a Binary Search Tree | 49.9% | Easy | 1.420061 |
| 102 | Binary Tree Level Order Traversal | 54.6% | Medium | 1.402656 |
| 381 | Insert Delete GetRandom O(1) – Duplicates allowed | 34.1% | Hard | 1.401537 |
| 1 | Two Sum | 45.6% | Easy | 1.399890 |
| 50 | Pow(x;n) | 30.3% | Medium | 1.295878 |
| 33 | Search in Rotated Sorted Array | 34.5% | Medium | 1.237393 |
| 20 | Valid Parentheses | 39.0% | Easy | 1.233368 |
| 273 | Integer to English Words | 27.1% | Hard | 1.218542 |
| 34 | Find First and Last Position of Element in Sorted Array | 36.2% | Medium | 1.209184 |
| 127 | Word Ladder | 29.6% | Medium | 1.187953 |
| 57 | Insert Interval | 33.5% | Hard | 1.173026 |
| 636 | Exclusive Time of Functions | 51.9% | Medium | 1.139200 |
| 384 | Shuffle an Array | 52.8% | Medium | 0.991100 |
| 1117 | Building H2O | 52.6% | Medium | 0.982960 |
| 69 | Sqrt(x) | 33.9% | Easy | 0.942541 |
| 146 | LRU Cache | 33.2% | Medium | 0.913867 |
| 46 | Permutations | 63.5% | Medium | 0.894485 |
| 655 | Print Binary Tree | 55.0% | Medium | 0.894220 |
| 13 | Roman to Integer | 55.7% | Easy | 0.893396 |
| 744 | Find Smallest Letter Greater Than Target | 45.4% | Easy | 0.853961 |
| 215 | Kth Largest Element in an Array | 55.4% | Medium | 0.756126 |
| 449 | Serialize and Deserialize BST | 52.0% | Medium | 0.748110 |
| 715 | Range Module | 38.5% | Hard | 0.747214 |
| 296 | Best Meeting Point | 57.5% | Hard | 0.726702 |
| 1188 | Design Bounded Blocking Queue | 70.5% | Medium | 0.717626 |
| 460 | LFU Cache | 34.2% | Hard | 0.668474 |
| 126 | Word Ladder II | 22.1% | Hard | 0.636415 |
| 160 | Intersection of Two Linked Lists | 40.6% | Easy | 0.604515 |
| 101 | Symmetric Tree | 46.8% | Easy | 0.598625 |
| 879 | Profitable Schemes | 39.8% | Hard | 0.556067 |
| 47 | Permutations II | 46.4% | Medium | 0.531985 |
| 104 | Maximum Depth of Binary Tree | 66.0% | Easy | 0.513251 |
| 706 | Design HashMap | 61.3% | Easy | 0.492623 |
| 412 | Fizz Buzz | 62.3% | Easy | 0.459021 |
| 311 | Sparse Matrix Multiplication | 61.9% | Medium | 0.450323 |
| 8 | String to Integer (atoi) | 15.4% | Medium | 0.407141 |
| 739 | Daily Temperatures | 63.3% | Medium | 0.401508 |
| 323 | Number of Connected Components in an Undirected Graph | 56.0% | Medium | 0.329842 |
| 367 | Valid Perfect Square | 41.7% | Easy | 0.320374 |
| 61 | Rotate List | 30.0% | Medium | 0.306824 |
| 349 | Intersection of Two Arrays | 62.5% | Easy | 0.304950 |
| 23 | Merge k Sorted Lists | 40.2% | Hard | 0.284301 |
| 547 | Friend Circles | 58.6% | Medium | 0.268191 |
| 450 | Delete Node in a BST | 43.1% | Medium | 0.261860 |
| 470 | Implement Rand10() Using Rand7() | 46.3% | Medium | 0.255346 |
| 173 | Binary Search Tree Iterator | 56.6% | Medium | 0.229432 |
| 796 | Rotate String | 49.6% | Easy | 0.220264 |
| 528 | Random Pick with Weight | 43.9% | Medium | 0.214363 |
| 322 | Coin Change | 35.5% | Medium | 0.204682 |
| 40 | Combination Sum II | 48.2% | Medium | 0.178061 |
| 88 | Merge Sorted Array | 39.4% | Easy | 0.176425 |
| 721 | Accounts Merge | 48.8% | Medium | 0.158363 |
| 155 | Min Stack | 44.5% | Easy | 0.158171 |
| 1148 | Article Views I | 75.8% | Easy | 0.154415 |
| 39 | Combination Sum | 56.1% | Medium | 0.133925 |
| 428 | Serialize and Deserialize N-ary Tree | 59.4% | Hard | 0.133135 |
| 54 | Spiral Matrix | 34.1% | Medium | 0.125727 |
| 1042 | Flower Planting With No Adjacent | 48.5% | Easy | 0.125457 |
| 21 | Merge Two Sorted Lists | 53.5% | Easy | 0.119556 |
| 75 | Sort Colors | 47.3% | Medium | 0.117894 |
| 103 | Binary Tree Zigzag Level Order Traversal | 48.3% | Medium | 0.116485 |
| 451 | Sort Characters By Frequency | 63.0% | Medium | 0.112583 |
| 973 | K Closest Points to Origin | 63.8% | Medium | 0.110875 |
| 198 | House Robber | 42.0% | Easy | 0.107851 |
| 1028 | Recover a Tree From Preorder Traversal | 69.9% | Hard | 0.107341 |
| 238 | Product of Array Except Self | 60.1% | Medium | 0.093903 |
| 833 | Find And Replace in String | 50.4% | Medium | 0.087519 |
| 100 | Same Tree | 53.4% | Easy | 0.086338 |
| 350 | Intersection of Two Arrays II | 51.4% | Easy | 0.080273 |
| 133 | Clone Graph | 34.8% | Medium | 0.070951 |
| 270 | Closest Binary Search Tree Value | 48.5% | Easy | 0.066802 |
| 98 | Validate Binary Search Tree | 27.8% | Medium | 0.057985 |
| 362 | Design Hit Counter | 63.7% | Medium | 0.056229 |
| 981 | Time Based Key-Value Store | 53.1% | Medium | 0.049406 |
| 121 | Best Time to Buy and Sell Stock | 50.5% | Easy | 0.042154 |
| 647 | Palindromic Substrings | 60.6% | Medium | 0.040968 |
| 141 | Linked List Cycle | 41.1% | Easy | 0.031012 |
| 240 | Search a 2D Matrix II | 43.2% | Medium | 0.029992 |
| 692 | Top K Frequent Words | 51.8% | Medium | 0.029730 |
| 987 | Vertical Order Traversal of a Binary Tree | 36.6% | Medium | 0.025915 |
| 387 | First Unique Character in a String | 53.4% | Easy | 0.025876 |
| 785 | Is Graph Bipartite? | 47.5% | Medium | 0.025105 |
| 70 | Climbing Stairs | 47.8% | Easy | 0.023866 |
| 113 | Path Sum II | 46.7% | Medium | 0.021882 |
| 359 | Logger Rate Limiter | 70.8% | Easy | 0.021053 |
| 207 | Course Schedule | 43.1% | Medium | 0.019709 |
| 347 | Top K Frequent Elements | 61.2% | Medium | 0.018049 |
| 79 | Word Search | 35.6% | Medium | 0.014883 |
| 142 | Linked List Cycle II | 37.3% | Medium | 0.014710 |
| 560 | Subarray Sum Equals K | 43.9% | Medium | 0.009603 |
| 279 | Perfect Squares | 47.4% | Medium | 0.009216 |
| 125 | Valid Palindrome | 36.7% | Easy | 0.008933 |
| 515 | Find Largest Value in Each Tree Row | 61.1% | Medium | 0 |
| 633 | Sum of Square Numbers | 32.2% | Easy | 0 |
| 946 | Validate Stack Sequences | 61.9% | Medium | 0 |
| 1107 | New Users Daily Count | 45.1% | Medium | 0 |
| 1127 | User Purchase Platform | 48.9% | Hard | 0 |
| 1149 | Article Views II | 48.2% | Medium | 0 |
| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | 64.2% | Medium | 0 |
