| ID | Title | Acceptance | Difficulty | Frequency |
|---|
| 937 | Reorder Data in Log Files | 54.3% | Easy | 5.669086 |
| 200 | Number of Islands | 46.8% | Medium | 5.561995 |
| 1192 | Critical Connections in a Network | 48.6% | Hard | 5.451163 |
| 1 | Two Sum | 45.6% | Easy | 5.340332 |
| 146 | LRU Cache | 33.2% | Medium | 5.266473 |
| 973 | K Closest Points to Origin | 63.8% | Medium | 5.155641 |
| 819 | Most Common Word | 44.8% | Easy | 5.044810 |
| 138 | Copy List with Random Pointer | 36.4% | Medium | 5.028653 |
| 5 | Longest Palindromic Substring | 29.5% | Medium | 4.917821 |
| 994 | Rotting Oranges | 49.2% | Medium | 4.806990 |
| 42 | Trapping Rain Water | 48.9% | Hard | 4.697248 |
| 23 | Merge k Sorted Lists | 40.2% | Hard | 4.599324 |
| 763 | Partition Labels | 76.1% | Medium | 4.548324 |
| 2 | Add Two Numbers | 33.9% | Medium | 4.437493 |
| 20 | Valid Parentheses | 39.0% | Easy | 4.362623 |
| 21 | Merge Two Sorted Lists | 53.5% | Easy | 4.322317 |
| 127 | Word Ladder | 29.6% | Medium | 4.310600 |
| 295 | Find Median from Data Stream | 44.3% | Hard | 4.291988 |
| 297 | Serialize and Deserialize Binary Tree | 47.5% | Hard | 4.291093 |
| 692 | Top K Frequent Words | 51.8% | Medium | 4.255293 |
| 572 | Subtree of Another Tree | 44.1% | Easy | 4.159077 |
| 240 | Search a 2D Matrix II | 43.2% | Medium | 4.048245 |
| 126 | Word Ladder II | 22.1% | Hard | 4.024013 |
| 472 | Concatenated Words | 43.7% | Hard | 3.921598 |
| 642 | Design Search Autocomplete System | 44.7% | Hard | 3.866784 |
| 957 | Prison Cells After N Days | 40.7% | Medium | 3.849230 |
| 121 | Best Time to Buy and Sell Stock | 50.5% | Easy | 3.815410 |
| 273 | Integer to English Words | 27.1% | Hard | 3.751742 |
| 4 | Median of Two Sorted Arrays | 29.6% | Hard | 3.729457 |
| 3 | Longest Substring Without Repeating Characters | 30.4% | Medium | 3.673122 |
| 253 | Meeting Rooms II | 45.7% | Medium | 3.650908 |
| 17 | Letter Combinations of a Phone Number | 46.8% | Medium | 3.646488 |
| 348 | Design Tic-Tac-Toe | 54.3% | Medium | 3.644912 |
| 139 | Word Break | 40.1% | Medium | 3.568929 |
| 155 | Min Stack | 44.5% | Easy | 3.543506 |
| 48 | Rotate Image | 56.7% | Medium | 3.541458 |
| 236 | Lowest Common Ancestor of a Binary Tree | 45.7% | Medium | 3.524778 |
| 238 | Product of Array Except Self | 60.1% | Medium | 3.514882 |
| 212 | Word Search II | 34.9% | Hard | 3.483790 |
| 12 | Integer to Roman | 55.1% | Medium | 3.460984 |
| 239 | Sliding Window Maximum | 43.0% | Hard | 3.433795 |
| 269 | Alien Dictionary | 33.3% | Hard | 3.377668 |
| 460 | LFU Cache | 34.2% | Hard | 3.377651 |
| 15 | 3Sum | 26.8% | Medium | 3.371084 |
| 33 | Search in Rotated Sorted Array | 34.5% | Medium | 3.366648 |
| 675 | Cut Off Trees for Golf Event | 34.6% | Hard | 3.362255 |
| 588 | Design In-Memory File System | 45.9% | Hard | 3.360532 |
| 909 | Snakes and Ladders | 38.4% | Medium | 3.343741 |
| 165 | Compare Version Numbers | 27.4% | Medium | 3.275920 |
| 56 | Merge Intervals | 39.3% | Medium | 3.274551 |
| 380 | Insert Delete GetRandom O(1) | 47.5% | Medium | 3.264575 |
| 53 | Maximum Subarray | 46.5% | Easy | 3.251839 |
| 49 | Group Anagrams | 56.9% | Medium | 3.246429 |
| 545 | Boundary of Binary Tree | 38.9% | Medium | 3.237053 |
| 11 | Container With Most Water | 50.8% | Medium | 3.177583 |
| 76 | Minimum Window Substring | 34.6% | Hard | 3.173047 |
| 54 | Spiral Matrix | 34.1% | Medium | 3.113302 |
| 1152 | Analyze User Website Visit Pattern | 43.5% | Medium | 3.092908 |
| 45 | Jump Game II | 30.6% | Hard | 3.079200 |
| 206 | Reverse Linked List | 62.5% | Easy | 3.067105 |
| 1167 | Minimum Cost to Connect Sticks | 62.8% | Medium | 3.060176 |
| 277 | Find the Celebrity | 41.8% | Medium | 2.949345 |
| 124 | Binary Tree Maximum Path Sum | 34.3% | Hard | 2.928933 |
| 322 | Coin Change | 35.5% | Medium | 2.922588 |
| 863 | All Nodes Distance K in Binary Tree | 55.4% | Medium | 2.858443 |
| 694 | Number of Distinct Islands | 56.0% | Medium | 2.841025 |
| 103 | Binary Tree Zigzag Level Order Traversal | 48.3% | Medium | 2.828681 |
| 733 | Flood Fill | 55.3% | Easy | 2.799884 |
| 25 | Reverse Nodes in k-Group | 42.1% | Hard | 2.761379 |
| 341 | Flatten Nested List Iterator | 52.9% | Medium | 2.754450 |
| 98 | Validate Binary Search Tree | 27.8% | Medium | 2.737334 |
| 490 | The Maze | 51.4% | Medium | 2.668429 |
| 208 | Implement Trie (Prefix Tree) | 49.4% | Medium | 2.653827 |
| 535 | Encode and Decode TinyURL | 79.9% | Medium | 2.648278 |
| 1268 | Search Suggestions System | 63.2% | Medium | 2.619138 |
| 224 | Basic Calculator | 36.8% | Hard | 2.618647 |
| 99 | Recover Binary Search Tree | 39.7% | Hard | 2.592791 |
| 289 | Game of Life | 54.5% | Medium | 2.585636 |
| 438 | Find All Anagrams in a String | 43.3% | Medium | 2.572235 |
| 116 | Populating Next Right Pointers in Each Node | 45.2% | Medium | 2.570963 |
| 22 | Generate Parentheses | 62.7% | Medium | 2.568523 |
| 218 | The Skyline Problem | 34.6% | Hard | 2.559475 |
| 772 | Basic Calculator III | 41.3% | Hard | 2.558138 |
| 314 | Binary Tree Vertical Order Traversal | 45.3% | Medium | 2.550800 |
| 387 | First Unique Character in a String | 53.4% | Easy | 2.547997 |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | 48.8% | Medium | 2.540402 |
| 215 | Kth Largest Element in an Array | 55.4% | Medium | 2.534797 |
| 102 | Binary Tree Level Order Traversal | 54.6% | Medium | 2.520333 |
| 207 | Course Schedule | 43.1% | Medium | 2.503721 |
| 91 | Decode Ways | 24.7% | Medium | 2.490602 |
| 140 | Word Break II | 32.6% | Hard | 2.479095 |
| 64 | Minimum Path Sum | 54.5% | Medium | 2.471655 |
| 84 | Largest Rectangle in Histogram | 35.2% | Hard | 2.446723 |
| 866 | Prime Palindrome | 24.9% | Medium | 2.426668 |
| 13 | Roman to Integer | 55.7% | Easy | 2.416073 |
| 227 | Basic Calculator II | 36.9% | Medium | 2.410014 |
| 117 | Populating Next Right Pointers in Each Node II | 39.1% | Medium | 2.395027 |
| 505 | The Maze II | 47.7% | Medium | 2.377524 |
| 449 | Serialize and Deserialize BST | 52.0% | Medium | 2.355719 |
| 55 | Jump Game | 34.6% | Medium | 2.354033 |
| 695 | Max Area of Island | 62.7% | Medium | 2.332859 |
| 362 | Design Hit Counter | 63.7% | Medium | 2.330220 |
| 235 | Lowest Common Ancestor of a Binary Search Tree | 49.9% | Easy | 2.328202 |
| 93 | Restore IP Addresses | 35.6% | Medium | 2.324986 |
| 1000 | Minimum Cost to Merge Stones | 39.8% | Hard | 2.285269 |
| 74 | Search a 2D Matrix | 36.5% | Medium | 2.275279 |
| 8 | String to Integer (atoi) | 15.4% | Medium | 2.240034 |
| 1102 | Path With Maximum Minimum Value | 49.2% | Medium | 2.236364 |
| 221 | Maximal Square | 37.7% | Medium | 2.235984 |
| 543 | Diameter of Binary Tree | 48.4% | Easy | 2.230047 |
| 101 | Symmetric Tree | 46.8% | Easy | 2.218229 |
| 711 | Number of Distinct Islands II | 47.3% | Hard | 2.197224 |
| 173 | Binary Search Tree Iterator | 56.6% | Medium | 2.189474 |
| 445 | Add Two Numbers II | 54.5% | Medium | 2.169549 |
| 143 | Reorder List | 37.1% | Medium | 2.148764 |
| 31 | Next Permutation | 32.6% | Medium | 2.148424 |
| 134 | Gas Station | 38.5% | Medium | 2.142566 |
| 234 | Palindrome Linked List | 39.3% | Easy | 2.134538 |
| 199 | Binary Tree Right Side View | 54.1% | Medium | 2.126523 |
| 72 | Edit Distance | 44.8% | Hard | 2.121008 |
| 149 | Max Points on a Line | 16.9% | Hard | 2.112687 |
| 79 | Word Search | 35.6% | Medium | 2.111131 |
| 347 | Top K Frequent Elements | 61.2% | Medium | 2.101870 |
| 62 | Unique Paths | 54.1% | Medium | 2.085041 |
| 631 | Design Excel Sum Formula | 31.6% | Hard | 2.073991 |
| 394 | Decode String | 50.0% | Medium | 2.066390 |
| 353 | Design Snake Game | 34.2% | Medium | 2.064312 |
| 384 | Shuffle an Array | 52.8% | Medium | 2.051144 |
| 323 | Number of Connected Components in an Undirected Graph | 56.0% | Medium | 2.042069 |
| 133 | Clone Graph | 34.8% | Medium | 2.032877 |
| 706 | Design HashMap | 61.3% | Easy | 1.999279 |
| 336 | Palindrome Pairs | 33.7% | Hard | 1.994773 |
| 682 | Baseball Game | 63.7% | Easy | 1.969876 |
| 759 | Employee Free Time | 66.2% | Hard | 1.949816 |
| 281 | Zigzag Iterator | 58.4% | Medium | 1.942419 |
| 1091 | Shortest Path in Binary Matrix | 38.2% | Medium | 1.925726 |
| 1120 | Maximum Average Subtree | 61.9% | Medium | 1.918033 |
| 185 | Department Top Three Salaries | 34.5% | Hard | 1.908524 |
| 150 | Evaluate Reverse Polish Notation | 36.3% | Medium | 1.901204 |
| 10 | Regular Expression Matching | 26.8% | Hard | 1.895297 |
| 564 | Find the Closest Palindrome | 19.7% | Hard | 1.889193 |
| 71 | Simplify Path | 32.6% | Medium | 1.888682 |
| 1099 | Two Sum Less Than K | 60.6% | Easy | 1.884409 |
| 96 | Unique Binary Search Trees | 52.9% | Medium | 1.883023 |
| 417 | Pacific Atlantic Water Flow | 41.1% | Medium | 1.876850 |
| 1279 | Traffic Light Controlled Intersection | 74.3% | Easy | 1.872666 |
| 122 | Best Time to Buy and Sell Stock II | 57.0% | Easy | 1.852594 |
| 895 | Maximum Frequency Stack | 60.6% | Hard | 1.849081 |
| 97 | Interleaving String | 31.5% | Hard | 1.839712 |
| 286 | Walls and Gates | 54.5% | Medium | 1.839120 |
| 640 | Solve the Equation | 42.0% | Medium | 1.833456 |
| 39 | Combination Sum | 56.1% | Medium | 1.817926 |
| 59 | Spiral Matrix II | 53.9% | Medium | 1.817619 |
| 317 | Shortest Distance from All Buildings | 41.4% | Hard | 1.810917 |
| 529 | Minesweeper | 59.1% | Medium | 1.789872 |
| 169 | Majority Element | 58.7% | Easy | 1.788905 |
| 152 | Maximum Product Subarray | 31.7% | Medium | 1.771346 |
| 503 | Next Greater Element II | 56.5% | Medium | 1.770513 |
| 210 | Course Schedule II | 40.7% | Medium | 1.770235 |
| 167 | Two Sum II – Input array is sorted | 54.1% | Easy | 1.758895 |
| 78 | Subsets | 62.0% | Medium | 1.755791 |
| 312 | Burst Balloons | 51.8% | Hard | 1.742629 |
| 88 | Merge Sorted Array | 39.4% | Easy | 1.741132 |
| 315 | Count of Smaller Numbers After Self | 41.5% | Hard | 1.737615 |
| 211 | Add and Search Word – Data structure design | 38.1% | Medium | 1.727663 |
| 252 | Meeting Rooms | 54.6% | Easy | 1.727286 |
| 92 | Reverse Linked List II | 38.8% | Medium | 1.726801 |
| 1155 | Number of Dice Rolls With Target Sum | 49.0% | Medium | 1.720070 |
| 160 | Intersection of Two Linked Lists | 40.6% | Easy | 1.717519 |
| 538 | Convert BST to Greater Tree | 55.4% | Easy | 1.715436 |
| 36 | Valid Sudoku | 48.7% | Medium | 1.714321 |
| 261 | Graph Valid Tree | 42.2% | Medium | 1.712055 |
| 41 | First Missing Positive | 32.0% | Hard | 1.707798 |
| 75 | Sort Colors | 47.3% | Medium | 1.705566 |
| 332 | Reconstruct Itinerary | 36.7% | Medium | 1.702479 |
| 388 | Longest Absolute File Path | 41.8% | Medium | 1.701920 |
| 980 | Unique Paths III | 73.3% | Hard | 1.694595 |
| 32 | Longest Valid Parentheses | 28.4% | Hard | 1.691977 |
| 128 | Longest Consecutive Sequence | 45.1% | Hard | 1.686584 |
| 653 | Two Sum IV – Input is a BST | 55.5% | Easy | 1.684088 |
| 153 | Find Minimum in Rotated Sorted Array | 45.1% | Medium | 1.677087 |
| 46 | Permutations | 63.5% | Medium | 1.672714 |
| 57 | Insert Interval | 33.5% | Hard | 1.663668 |
| 560 | Subarray Sum Equals K | 43.9% | Medium | 1.659253 |
| 228 | Summary Ranges | 39.5% | Medium | 1.656737 |
| 19 | Remove Nth Node From End of List | 35.2% | Medium | 1.652142 |
| 815 | Bus Routes | 42.5% | Hard | 1.652011 |
| 109 | Convert Sorted List to Binary Search Tree | 47.7% | Medium | 1.649357 |
| 177 | Nth Highest Salary | 31.4% | Medium | 1.645549 |
| 489 | Robot Room Cleaner | 69.7% | Hard | 1.632432 |
| 268 | Missing Number | 51.7% | Easy | 1.632076 |
| 767 | Reorganize String | 48.7% | Medium | 1.629188 |
| 123 | Best Time to Buy and Sell Stock III | 37.5% | Hard | 1.626950 |
| 496 | Next Greater Element I | 63.8% | Easy | 1.623294 |
| 179 | Largest Number | 28.8% | Medium | 1.616394 |
| 739 | Daily Temperatures | 63.3% | Medium | 1.616070 |
| 135 | Candy | 31.6% | Hard | 1.608531 |
| 333 | Largest BST Subtree | 35.8% | Medium | 1.608189 |
| 716 | Max Stack | 42.6% | Easy | 1.596707 |
| 983 | Minimum Cost For Tickets | 60.5% | Medium | 1.590012 |
| 284 | Peeking Iterator | 45.7% | Medium | 1.573409 |
| 703 | Kth Largest Element in a Stream | 49.7% | Easy | 1.570771 |
| 403 | Frog Jump | 39.7% | Hard | 1.564860 |
| 987 | Vertical Order Traversal of a Binary Tree | 36.6% | Medium | 1.564572 |
| 1135 | Connecting Cities With Minimum Cost | 57.5% | Medium | 1.558144 |
| 24 | Swap Nodes in Pairs | 50.4% | Medium | 1.557364 |
| 437 | Path Sum III | 47.2% | Medium | 1.555411 |
| 300 | Longest Increasing Subsequence | 42.6% | Medium | 1.549004 |
| 85 | Maximal Rectangle | 37.7% | Hard | 1.537804 |
| 456 | 132 Pattern | 28.9% | Medium | 1.525732 |
| 141 | Linked List Cycle | 41.1% | Easy | 1.522542 |
| 113 | Path Sum II | 46.7% | Medium | 1.515051 |
| 285 | Inorder Successor in BST | 40.4% | Medium | 1.510518 |
| 373 | Find K Pairs with Smallest Sums | 36.7% | Medium | 1.508429 |
| 188 | Best Time to Buy and Sell Stock IV | 28.0% | Hard | 1.504354 |
| 346 | Moving Average from Data Stream | 70.9% | Easy | 1.502690 |
| 16 | 3Sum Closest | 46.0% | Medium | 1.502292 |
| 70 | Climbing Stairs | 47.8% | Easy | 1.499205 |
| 51 | N-Queens | 46.6% | Hard | 1.498552 |
| 556 | Next Greater Element III | 31.7% | Medium | 1.495390 |
| 148 | Sort List | 42.3% | Medium | 1.493062 |
| 287 | Find the Duplicate Number | 55.5% | Medium | 1.492409 |
| 518 | Coin Change 2 | 50.2% | Medium | 1.488869 |
| 176 | Second Highest Salary | 31.6% | Easy | 1.488495 |
| 120 | Triangle | 44.2% | Medium | 1.484114 |
| 18 | 4Sum | 33.7% | Medium | 1.478249 |
| 270 | Closest Binary Search Tree Value | 48.5% | Easy | 1.478223 |
| 378 | Kth Smallest Element in a Sorted Matrix | 54.3% | Medium | 1.477526 |
| 540 | Single Element in a Sorted Array | 57.9% | Medium | 1.453572 |
| 205 | Isomorphic Strings | 39.8% | Easy | 1.425780 |
| 63 | Unique Paths II | 34.6% | Medium | 1.425285 |
| 1044 | Longest Duplicate Substring | 31.9% | Hard | 1.423379 |
| 73 | Set Matrix Zeroes | 43.1% | Medium | 1.412093 |
| 480 | Sliding Window Median | 37.2% | Hard | 1.410024 |
| 68 | Text Justification | 27.7% | Hard | 1.408642 |
| 232 | Implement Queue using Stacks | 49.6% | Easy | 1.405609 |
| 628 | Maximum Product of Three Numbers | 47.1% | Easy | 1.395625 |
| 442 | Find All Duplicates in an Array | 67.8% | Medium | 1.387907 |
| 229 | Majority Element II | 35.6% | Medium | 1.387856 |
| 14 | Longest Common Prefix | 35.4% | Easy | 1.384609 |
| 787 | Cheapest Flights Within K Stops | 39.3% | Medium | 1.378544 |
| 340 | Longest Substring with At Most K Distinct Characters | 44.1% | Hard | 1.376802 |
| 325 | Maximum Size Subarray Sum Equals k | 46.8% | Medium | 1.371822 |
| 44 | Wildcard Matching | 24.7% | Hard | 1.361233 |
| 770 | Basic Calculator IV | 48.1% | Hard | 1.349926 |
| 136 | Single Number | 65.5% | Easy | 1.348462 |
| 298 | Binary Tree Longest Consecutive Sequence | 47.1% | Medium | 1.346804 |
| 329 | Longest Increasing Path in a Matrix | 43.4% | Hard | 1.344540 |
| 943 | Find the Shortest Superstring | 42.9% | Hard | 1.344077 |
| 636 | Exclusive Time of Functions | 52.0% | Medium | 1.337457 |
| 369 | Plus One Linked List | 58.2% | Medium | 1.337363 |
| 836 | Rectangle Overlap | 48.6% | Easy | 1.309376 |
| 104 | Maximum Depth of Binary Tree | 66.0% | Easy | 1.303689 |
| 28 | Implement strStr() | 34.5% | Easy | 1.300431 |
| 652 | Find Duplicate Subtrees | 50.2% | Medium | 1.294755 |
| 6 | ZigZag Conversion | 36.3% | Medium | 1.294591 |
| 399 | Evaluate Division | 51.6% | Medium | 1.277612 |
| 516 | Longest Palindromic Subsequence | 53.2% | Medium | 1.264778 |
| 678 | Valid Parenthesis String | 31.0% | Medium | 1.262155 |
| 30 | Substring with Concatenation of All Words | 25.4% | Hard | 1.257695 |
| 242 | Valid Anagram | 56.9% | Easy | 1.252391 |
| 349 | Intersection of Two Arrays | 62.5% | Easy | 1.250030 |
| 688 | Knight Probability in Chessboard | 48.9% | Medium | 1.249979 |
| 981 | Time Based Key-Value Store | 53.1% | Medium | 1.247523 |
| 344 | Reverse String | 68.5% | Easy | 1.246073 |
| 1011 | Capacity To Ship Packages Within D Days | 58.1% | Medium | 1.245643 |
| 301 | Remove Invalid Parentheses | 43.3% | Hard | 1.242036 |
| 29 | Divide Two Integers | 16.4% | Medium | 1.239324 |
| 112 | Path Sum | 41.2% | Easy | 1.229277 |
| 1038 | Binary Search Tree to Greater Sum Tree | 80.8% | Medium | 1.201779 |
| 1100 | Find K-Length Substrings With No Repeated Characters | 72.7% | Medium | 1.184336 |
| 50 | Pow(x;n) | 30.3% | Medium | 1.176892 |
| 997 | Find the Town Judge | 50.1% | Easy | 1.174873 |
| 37 | Sudoku Solver | 43.6% | Hard | 1.170704 |
| 805 | Split Array With Same Average | 26.4% | Hard | 1.168509 |
| 225 | Implement Stack using Queues | 45.1% | Easy | 1.160739 |
| 854 | K-Similar Strings | 38.2% | Hard | 1.159451 |
| 230 | Kth Smallest Element in a BST | 60.2% | Medium | 1.155444 |
| 721 | Accounts Merge | 48.8% | Medium | 1.132047 |
| 622 | Design Circular Queue | 43.7% | Medium | 1.115132 |
| 409 | Longest Palindrome | 50.3% | Easy | 1.111534 |
| 542 | 01 Matrix | 39.8% | Medium | 1.098310 |
| 726 | Number of Atoms | 49.0% | Hard | 1.095317 |
| 426 | Convert Binary Search Tree to Sorted Doubly Linked List | 59.1% | Medium | 1.093698 |
| 352 | Data Stream as Disjoint Intervals | 47.3% | Hard | 1.088832 |
| 794 | Valid Tic-Tac-Toe State | 32.6% | Medium | 1.084013 |
| 430 | Flatten a Multilevel Doubly Linked List | 55.1% | Medium | 1.075910 |
| 257 | Binary Tree Paths | 51.5% | Easy | 1.070178 |
| 130 | Surrounded Regions | 28.1% | Medium | 1.058078 |
| 283 | Move Zeroes | 57.8% | Easy | 1.057417 |
| 94 | Binary Tree Inorder Traversal | 63.3% | Medium | 1.049418 |
| 131 | Palindrome Partitioning | 47.5% | Medium | 1.047877 |
| 81 | Search in Rotated Sorted Array II | 33.0% | Medium | 1.042801 |
| 187 | Repeated DNA Sequences | 38.9% | Medium | 1.029105 |
| 266 | Palindrome Permutation | 61.9% | Easy | 1.027494 |
| 7 | Reverse Integer | 25.8% | Easy | 1.026156 |
| 381 | Insert Delete GetRandom O(1) – Duplicates allowed | 34.1% | Hard | 1.026132 |
| 498 | Diagonal Traverse | 48.2% | Medium | 1.025668 |
| 1219 | Path with Maximum Gold | 65.1% | Medium | 1.020055 |
| 547 | Friend Circles | 58.6% | Medium | 1.019483 |
| 86 | Partition List | 41.5% | Medium | 1.013118 |
| 1032 | Stream of Characters | 48.3% | Hard | 0.999974 |
| 508 | Most Frequent Subtree Sum | 57.9% | Medium | 0.993295 |
| 226 | Invert Binary Tree | 65.0% | Easy | 0.990106 |
| 279 | Perfect Squares | 47.4% | Medium | 0.988611 |
| 181 | Employees Earning More Than Their Managers | 56.9% | Easy | 0.985579 |
| 114 | Flatten Binary Tree to Linked List | 49.3% | Medium | 0.979314 |
| 647 | Palindromic Substrings | 60.6% | Medium | 0.968336 |
| 412 | Fizz Buzz | 62.3% | Easy | 0.962457 |
| 108 | Convert Sorted Array to Binary Search Tree | 57.9% | Easy | 0.959189 |
| 1236 | Web Crawler | 64.3% | Medium | 0.955511 |
| 1214 | Two Sum BSTs | 67.6% | Medium | 0.954006 |
| 993 | Cousins in Binary Tree | 52.0% | Easy | 0.949887 |
| 635 | Design Log Storage System | 58.6% | Medium | 0.944810 |
| 186 | Reverse Words in a String II | 43.3% | Medium | 0.944461 |
| 61 | Rotate List | 30.0% | Medium | 0.939461 |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | 47.4% | Easy | 0.930911 |
| 34 | Find First and Last Position of Element in Sorted Array | 36.2% | Medium | 0.930848 |
| 175 | Combine Two Tables | 60.8% | Easy | 0.922030 |
| 272 | Closest Binary Search Tree Value II | 50.5% | Hard | 0.918640 |
| 847 | Shortest Path Visiting All Nodes | 52.0% | Hard | 0.916290 |
| 243 | Shortest Word Distance | 61.0% | Easy | 0.915666 |
| 204 | Count Primes | 31.5% | Easy | 0.913163 |
| 142 | Linked List Cycle II | 37.3% | Medium | 0.909052 |
| 69 | Sqrt(x) | 33.9% | Easy | 0.907557 |
| 419 | Battleships in a Board | 70.0% | Medium | 0.906605 |
| 9 | Palindrome Number | 48.4% | Easy | 0.905261 |
| 166 | Fraction to Recurring Decimal | 21.6% | Medium | 0.904516 |
| 1046 | Last Stone Weight | 62.2% | Easy | 0.903681 |
| 463 | Island Perimeter | 65.7% | Easy | 0.897758 |
| 406 | Queue Reconstruction by Height | 66.9% | Medium | 0.896215 |
| 978 | Longest Turbulent Subarray | 46.6% | Medium | 0.895013 |
| 162 | Find Peak Element | 43.3% | Medium | 0.889268 |
| 366 | Find Leaves of Binary Tree | 70.6% | Medium | 0.883955 |
| 690 | Employee Importance | 57.3% | Easy | 0.861251 |
| 698 | Partition to K Equal Sum Subsets | 45.0% | Medium | 0.860611 |
| 528 | Random Pick with Weight | 43.9% | Medium | 0.853787 |
| 38 | Count and Say | 44.6% | Easy | 0.845162 |
| 986 | Interval List Intersections | 67.3% | Medium | 0.844800 |
| 699 | Falling Squares | 41.8% | Hard | 0.842564 |
| 708 | Insert into a Sorted Circular Linked List | 31.6% | Medium | 0.841248 |
| 316 | Remove Duplicate Letters | 35.8% | Hard | 0.835526 |
| 110 | Balanced Binary Tree | 43.5% | Easy | 0.826480 |
| 1024 | Video Stitching | 49.2% | Medium | 0.825299 |
| 428 | Serialize and Deserialize N-ary Tree | 59.4% | Hard | 0.824896 |
| 443 | String Compression | 41.3% | Easy | 0.817135 |
| 402 | Remove K Digits | 28.4% | Medium | 0.801437 |
| 361 | Bomb Enemy | 46.0% | Medium | 0.797659 |
| 233 | Number of Digit One | 31.3% | Hard | 0.795650 |
| 658 | Find K Closest Elements | 40.9% | Medium | 0.793091 |
| 451 | Sort Characters By Frequency | 63.0% | Medium | 0.786167 |
| 351 | Android Unlock Patterns | 48.4% | Medium | 0.785739 |
| 350 | Intersection of Two Arrays II | 51.4% | Easy | 0.777210 |
| 632 | Smallest Range Covering Elements from K Lists | 52.4% | Hard | 0.776712 |
| 159 | Longest Substring with At Most Two Distinct Characters | 49.4% | Medium | 0.771917 |
| 843 | Guess the Word | 46.1% | Hard | 0.771399 |
| 421 | Maximum XOR of Two Numbers in an Array | 53.5% | Medium | 0.768784 |
| 198 | House Robber | 42.0% | Easy | 0.766834 |
| 432 | All O`one Data Structure | 32.4% | Hard | 0.761188 |
| 992 | Subarrays with K Different Integers | 48.6% | Hard | 0.761008 |
| 785 | Is Graph Bipartite? | 47.5% | Medium | 0.756095 |
| 280 | Wiggle Sort | 63.8% | Medium | 0.748973 |
| 337 | House Robber III | 50.6% | Medium | 0.746301 |
| 807 | Max Increase to Keep City Skyline | 83.7% | Medium | 0.746046 |
| 465 | Optimal Account Balancing | 46.9% | Hard | 0.744835 |
| 410 | Split Array Largest Sum | 44.5% | Hard | 0.744113 |
| 189 | Rotate Array | 34.7% | Easy | 0.741620 |
| 125 | Valid Palindrome | 36.7% | Easy | 0.735176 |
| 1197 | Minimum Knight Moves | 36.1% | Medium | 0.734842 |
| 662 | Maximum Width of Binary Tree | 41.0% | Medium | 0.734717 |
| 1083 | Sales Analysis II | 50.5% | Easy | 0.733766 |
| 83 | Remove Duplicates from Sorted List | 45.4% | Easy | 0.730981 |
| 40 | Combination Sum II | 48.2% | Medium | 0.723247 |
| 1215 | Stepping Numbers | 41.6% | Medium | 0.722134 |
| 735 | Asteroid Collision | 41.0% | Medium | 0.721526 |
| 82 | Remove Duplicates from Sorted List II | 36.8% | Medium | 0.721463 |
| 310 | Minimum Height Trees | 32.3% | Medium | 0.716101 |
| 737 | Sentence Similarity II | 45.8% | Medium | 0.714200 |
| 129 | Sum Root to Leaf Numbers | 49.1% | Medium | 0.712195 |
| 171 | Excel Sheet Column Number | 55.9% | Easy | 0.701136 |
| 328 | Odd Even Linked List | 55.7% | Medium | 0.700505 |
| 617 | Merge Two Binary Trees | 74.1% | Easy | 0.695115 |
| 1429 | First Unique Number | 47.0% | Medium | 0.689006 |
| 1086 | High Five | 79.7% | Easy | 0.684580 |
| 231 | Power of Two | 43.7% | Easy | 0.682325 |
| 525 | Contiguous Array | 42.8% | Medium | 0.681861 |
| 65 | Valid Number | 15.3% | Hard | 0.681519 |
| 151 | Reverse Words in a String | 21.9% | Medium | 0.673804 |
| 164 | Maximum Gap | 35.5% | Hard | 0.669776 |
| 356 | Line Reflection | 31.8% | Medium | 0.666159 |
| 509 | Fibonacci Number | 67.2% | Easy | 0.664818 |
| 161 | One Edit Distance | 32.3% | Medium | 0.654074 |
| 901 | Online Stock Span | 60.2% | Medium | 0.652873 |
| 202 | Happy Number | 50.4% | Easy | 0.644604 |
| 1229 | Meeting Scheduler | 52.7% | Medium | 0.631447 |
| 517 | Super Washing Machines | 38.3% | Hard | 0.625705 |
| 1275 | Find Winner on a Tic Tac Toe Game | 52.8% | Easy | 0.625705 |
| 1022 | Sum of Root To Leaf Binary Numbers | 67.2% | Easy | 0.617723 |
| 90 | Subsets II | 47.1% | Medium | 0.603916 |
| 775 | Global and Local Inversions | 42.1% | Medium | 0.603059 |
| 26 | Remove Duplicates from Sorted Array | 45.1% | Easy | 0.599298 |
| 433 | Minimum Genetic Mutation | 41.8% | Medium | 0.597837 |
| 137 | Single Number II | 52.4% | Medium | 0.591561 |
| 184 | Department Highest Salary | 36.7% | Medium | 0.587261 |
| 1004 | Max Consecutive Ones III | 59.1% | Medium | 0.582678 |
| 407 | Trapping Rain Water II | 42.4% | Hard | 0.580113 |
| 377 | Combination Sum IV | 45.3% | Medium | 0.565026 |
| 106 | Construct Binary Tree from Inorder and Postorder Traversal | 47.2% | Medium | 0.564849 |
| 1166 | Design File System | 56.8% | Medium | 0.563210 |
| 634 | Find the Derangement of An Array | 40.1% | Medium | 0.562307 |
| 725 | Split Linked List in Parts | 52.2% | Medium | 0.561800 |
| 729 | My Calendar I | 51.8% | Medium | 0.560410 |
| 132 | Palindrome Partitioning II | 30.2% | Hard | 0.558643 |
| 929 | Unique Email Addresses | 67.4% | Easy | 0.558198 |
| 250 | Count Univalue Subtrees | 52.0% | Medium | 0.558033 |
| 118 | Pascal’s Triangle | 52.5% | Easy | 0.557727 |
| 217 | Contains Duplicate | 56.0% | Easy | 0.557221 |
| 60 | Permutation Sequence | 38.4% | Hard | 0.556508 |
| 296 | Best Meeting Point | 57.5% | Hard | 0.554941 |
| 66 | Plus One | 43.0% | Easy | 0.551107 |
| 355 | Design Twitter | 30.3% | Medium | 0.550795 |
| 715 | Range Module | 38.5% | Hard | 0.537142 |
| 765 | Couples Holding Hands | 54.3% | Hard | 0.535710 |
| 611 | Valid Triangle Number | 48.4% | Medium | 0.528067 |
| 299 | Bulls and Cows | 42.4% | Easy | 0.525442 |
| 415 | Add Strings | 47.5% | Easy | 0.523163 |
| 209 | Minimum Size Subarray Sum | 38.2% | Medium | 0.521415 |
| 557 | Reverse Words in a String III | 69.8% | Easy | 0.517303 |
| 719 | Find K-th Smallest Pair Distance | 31.5% | Hard | 0.516327 |
| 335 | Self Crossing | 28.0% | Hard | 0.514181 |
| 393 | UTF-8 Validation | 37.5% | Medium | 0.514046 |
| 192 | Word Frequency | 25.8% | Medium | 0.512968 |
| 1057 | Campus Bikes | 57.7% | Medium | 0.508613 |
| 701 | Insert into a Binary Search Tree | 77.7% | Medium | 0.507378 |
| 771 | Jewels and Stones | 86.4% | Easy | 0.506722 |
| 686 | Repeated String Match | 32.3% | Easy | 0.501021 |
| 541 | Reverse String II | 48.4% | Easy | 0.495822 |
| 637 | Average of Levels in Binary Tree | 63.1% | Easy | 0.495217 |
| 163 | Missing Ranges | 24.3% | Medium | 0.491822 |
| 743 | Network Delay Time | 45.0% | Medium | 0.487601 |
| 365 | Water and Jug Problem | 30.6% | Medium | 0.486847 |
| 319 | Bulb Switcher | 45.4% | Medium | 0.478490 |
| 395 | Longest Substring with At Least K Repeating Characters | 41.4% | Medium | 0.478170 |
| 339 | Nested List Weight Sum | 74.0% | Easy | 0.475342 |
| 1031 | Maximum Sum of Two Non-Overlapping Subarrays | 57.9% | Medium | 0.473070 |
| 1122 | Relative Sort Array | 67.7% | Easy | 0.470873 |
| 89 | Gray Code | 49.1% | Medium | 0.470590 |
| 111 | Minimum Depth of Binary Tree | 37.4% | Easy | 0.469671 |
| 371 | Sum of Two Integers | 50.7% | Medium | 0.469029 |
| 558 | Logical OR of Two Binary Grids Represented as Quad-Trees | 44.6% | Medium | 0.468136 |
| 844 | Backspace String Compare | 46.4% | Easy | 0.467418 |
| 354 | Russian Doll Envelopes | 35.6% | Hard | 0.466399 |
| 773 | Sliding Puzzle | 59.3% | Hard | 0.463961 |
| 1161 | Maximum Level Sum of a Binary Tree | 72.2% | Medium | 0.462841 |
| 413 | Arithmetic Slices | 57.9% | Medium | 0.459949 |
| 515 | Find Largest Value in Each Tree Row | 61.1% | Medium | 0.459405 |
| 427 | Construct Quad Tree | 61.4% | Medium | 0.458574 |
| 450 | Delete Node in a BST | 43.1% | Medium | 0.448492 |
| 100 | Same Tree | 53.4% | Easy | 0.446989 |
| 468 | Validate IP Address | 24.1% | Medium | 0.445585 |
| 305 | Number of Islands II | 40.1% | Hard | 0.442937 |
| 1002 | Find Common Characters | 67.6% | Easy | 0.440870 |
| 1172 | Dinner Plate Stacks | 38.2% | Hard | 0.440596 |
| 1360 | Number of Days Between Two Dates | 48.8% | Easy | 0.440596 |
| 1019 | Next Greater Node In Linked List | 57.4% | Medium | 0.435574 |
| 473 | Matchsticks to Square | 37.7% | Medium | 0.428001 |
| 727 | Minimum Window Subsequence | 41.8% | Hard | 0.425465 |
| 183 | Customers Who Never Order | 53.4% | Easy | 0.423609 |
| 1130 | Minimum Cost Tree From Leaf Values | 66.1% | Medium | 0.422007 |
| 683 | K Empty Slots | 35.6% | Hard | 0.419481 |
| 43 | Multiply Strings | 33.9% | Medium | 0.416580 |
| 849 | Maximize Distance to Closest Person | 42.6% | Easy | 0.414728 |
| 178 | Rank Scores | 45.8% | Medium | 0.413473 |
| 222 | Count Complete Tree Nodes | 46.8% | Medium | 0.410861 |
| 304 | Range Sum Query 2D – Immutable | 38.6% | Medium | 0.408379 |
| 1094 | Car Pooling | 56.7% | Medium | 0.406830 |
| 1066 | Campus Bikes II | 54.2% | Medium | 0.400323 |
| 416 | Partition Equal Subset Sum | 43.7% | Medium | 0.399266 |
| 1335 | Minimum Difficulty of a Job Schedule | 57.6% | Hard | 0.396304 |
| 241 | Different Ways to Add Parentheses | 55.2% | Medium | 0.395191 |
| 145 | Binary Tree Postorder Traversal | 55.0% | Hard | 0.393895 |
| 1373 | Maximum Sum BST in Binary Tree | 40.2% | Hard | 0.393187 |
| 687 | Longest Univalue Path | 36.2% | Easy | 0.393102 |
| 47 | Permutations II | 46.4% | Medium | 0.389543 |
| 1188 | Design Bounded Blocking Queue | 70.5% | Medium | 0.382859 |
| 237 | Delete Node in a Linked List | 63.8% | Easy | 0.382200 |
| 1074 | Number of Submatrices That Sum to Target | 60.4% | Hard | 0.379295 |
| 646 | Maximum Length of Pair Chain | 51.9% | Medium | 0.378500 |
| 924 | Minimize Malware Spread | 42.0% | Hard | 0.376477 |
| 321 | Create Maximum Number | 27.0% | Hard | 0.376477 |
| 1084 | Sales Analysis III | 54.3% | Easy | 0.376405 |
| 567 | Permutation in String | 44.4% | Medium | 0.375399 |
| 307 | Range Sum Query – Mutable | 34.6% | Medium | 0.375220 |
| 969 | Pancake Sorting | 67.5% | Medium | 0.373513 |
| 889 | Construct Binary Tree from Preorder and Postorder Traversal | 66.2% | Medium | 0.373121 |
| 115 | Distinct Subsequences | 38.3% | Hard | 0.372268 |
| 1081 | Smallest Subsequence of Distinct Characters | 50.4% | Medium | 0.366362 |
| 1143 | Longest Common Subsequence | 58.4% | Medium | 0.361080 |
| 214 | Shortest Palindrome | 29.8% | Hard | 0.354934 |
| 345 | Reverse Vowels of a String | 44.2% | Easy | 0.354073 |
| 783 | Minimum Distance Between BST Nodes | 52.6% | Easy | 0.353950 |
| 264 | Ugly Number II | 42.0% | Medium | 0.350792 |
| 180 | Consecutive Numbers | 39.7% | Medium | 0.346052 |
| 618 | Students Report By Geography | 55.0% | Hard | 0.345604 |
| 107 | Binary Tree Level Order Traversal II | 53.5% | Easy | 0.345316 |
| 905 | Sort Array By Parity | 74.1% | Easy | 0.341971 |
| 860 | Lemonade Change | 51.6% | Easy | 0.341443 |
| 581 | Shortest Unsorted Continuous Subarray | 31.1% | Easy | 0.340971 |
| 334 | Increasing Triplet Subsequence | 40.0% | Medium | 0.339819 |
| 390 | Elimination Game | 44.5% | Medium | 0.337906 |
| 579 | Find Cumulative Salary of an Employee | 37.0% | Hard | 0.337188 |
| 262 | Trips and Users | 32.7% | Hard | 0.336239 |
| 1405 | Longest Happy String | 49.0% | Medium | 0.336015 |
| 420 | Strong Password Checker | 14.0% | Hard | 0.331962 |
| 827 | Making A Large Island | 45.7% | Hard | 0.328795 |
| 1315 | Sum of Nodes with Even-Valued Grandparent | 83.5% | Medium | 0.328115 |
| 1062 | Longest Repeating Substring | 57.2% | Medium | 0.326091 |
| 447 | Number of Boomerangs | 51.8% | Easy | 0.324756 |
| 532 | K-diff Pairs in an Array | 31.6% | Easy | 0.324239 |
| 1311 | Get Watched Videos by Your Friends | 43.1% | Medium | 0.320742 |
| 290 | Word Pattern | 37.0% | Easy | 0.319213 |
| 876 | Middle of the Linked List | 68.4% | Easy | 0.318488 |
| 710 | Random Pick with Blacklist | 32.5% | Hard | 0.316197 |
| 918 | Maximum Sum Circular Subarray | 33.7% | Medium | 0.315917 |
| 191 | Number of 1 Bits | 49.8% | Easy | 0.313001 |
| 873 | Length of Longest Fibonacci Subsequence | 48.0% | Medium | 0.311910 |
| 586 | Customer Placing the Largest Number of Orders | 73.0% | Easy | 0.311518 |
| 383 | Ransom Note | 53.1% | Easy | 0.307484 |
| 174 | Dungeon Game | 32.3% | Hard | 0.305958 |
| 657 | Robot Return to Origin | 73.5% | Easy | 0.305730 |
| 841 | Keys and Rooms | 64.3% | Medium | 0.297514 |
| 1244 | Design A Leaderboard | 60.7% | Medium | 0.296819 |
| 938 | Range Sum of BST | 81.3% | Easy | 0.296220 |
| 95 | Unique Binary Search Trees II | 40.6% | Medium | 0.295829 |
| 203 | Remove Linked List Elements | 38.6% | Easy | 0.293908 |
| 359 | Logger Rate Limiter | 70.8% | Easy | 0.292987 |
| 919 | Complete Binary Tree Inserter | 57.3% | Medium | 0.291434 |
| 796 | Rotate String | 49.6% | Easy | 0.289220 |
| 559 | Maximum Depth of N-ary Tree | 68.7% | Easy | 0.288026 |
| 158 | Read N Characters Given Read4 II – Call multiple times | 33.8% | Hard | 0.281525 |
| 1104 | Path In Zigzag Labelled Binary Tree | 72.0% | Medium | 0.280571 |
| 382 | Linked List Random Node | 52.1% | Medium | 0.280215 |
| 732 | My Calendar III | 60.0% | Hard | 0.279584 |
| 1007 | Minimum Domino Rotations For Equal Row | 50.0% | Medium | 0.275493 |
| 244 | Shortest Word Distance II | 52.3% | Medium | 0.275228 |
| 77 | Combinations | 54.7% | Medium | 0.274411 |
| 414 | Third Maximum Number | 30.5% | Easy | 0.273791 |
| 1108 | Defanging an IP Address | 87.5% | Easy | 0.270750 |
| 1013 | Partition Array Into Three Parts With Equal Sum | 51.8% | Easy | 0.263290 |
| 119 | Pascal’s Triangle II | 49.0% | Easy | 0.261696 |
| 1139 | Largest 1-Bordered Square | 47.5% | Medium | 0.261597 |
| 746 | Min Cost Climbing Stairs | 50.3% | Easy | 0.261187 |
| 453 | Minimum Moves to Equal Array Elements | 50.2% | Easy | 0.260531 |
| 466 | Count The Repetitions | 28.2% | Hard | 0.256168 |
| 570 | Managers with at Least 5 Direct Reports | 66.0% | Medium | 0.255346 |
| 609 | Find Duplicate File in System | 59.5% | Medium | 0.253880 |
| 762 | Prime Number of Set Bits in Binary Representation | 63.2% | Easy | 0.247793 |
| 368 | Largest Divisible Subset | 38.0% | Medium | 0.244787 |
| 881 | Boats to Save People | 46.8% | Medium | 0.243205 |
| 452 | Minimum Number of Arrows to Burst Balloons | 49.6% | Medium | 0.238433 |
| 731 | My Calendar II | 49.1% | Medium | 0.236388 |
| 1047 | Remove All Adjacent Duplicates In String | 68.6% | Easy | 0.236008 |
| 779 | K-th Symbol in Grammar | 37.2% | Medium | 0.235302 |
| 1270 | All People Report to the Given Manager | 87.1% | Medium | 0.234993 |
| 507 | Perfect Number | 35.5% | Easy | 0.234938 |
| 35 | Search Insert Position | 42.6% | Easy | 0.232692 |
| 397 | Integer Replacement | 32.9% | Medium | 0.232252 |
| 811 | Subdomain Visit Count | 69.9% | Easy | 0.225530 |
| 311 | Sparse Matrix Multiplication | 61.9% | Medium | 0.225388 |
| 939 | Minimum Area Rectangle | 51.8% | Medium | 0.216922 |
| 435 | Non-overlapping Intervals | 42.9% | Medium | 0.215649 |
| 669 | Trim a Binary Search Tree | 63.0% | Easy | 0.212458 |
| 626 | Exchange Seats | 62.3% | Medium | 0.210327 |
| 741 | Cherry Pickup | 33.9% | Hard | 0.209091 |
| 862 | Shortest Subarray with Sum at Least K | 24.6% | Hard | 0.208242 |
| 1249 | Minimum Remove to Make Valid Parentheses | 62.5% | Medium | 0.207783 |
| 1202 | Smallest String With Swaps | 46.5% | Medium | 0.207159 |
| 604 | Design Compressed String Iterator | 37.5% | Easy | 0.205852 |
| 1008 | Construct Binary Search Tree from Preorder Traversal | 78.4% | Medium | 0.205397 |
| 1254 | Number of Closed Islands | 60.5% | Medium | 0.203124 |
| 1375 | Bulb Switcher III | 62.6% | Medium | 0.196226 |
| 1060 | Missing Element in Sorted Array | 54.5% | Medium | 0.195060 |
| 601 | Human Traffic of Stadium | 41.7% | Hard | 0.194313 |
| 1198 | Find Smallest Common Element in All Rows | 74.9% | Medium | 0.191055 |
| 756 | Pyramid Transition Matrix | 54.6% | Medium | 0.191055 |
| 358 | Rearrange String k Distance Apart | 34.9% | Hard | 0.190043 |
| 995 | Minimum Number of K Consecutive Bit Flips | 46.8% | Hard | 0.190043 |
| 864 | Shortest Path to Get All Keys | 40.1% | Hard | 0.189241 |
| 549 | Binary Tree Longest Consecutive Sequence II | 47.0% | Medium | 0.188447 |
| 900 | RLE Iterator | 53.5% | Medium | 0.188447 |
| 681 | Next Closest Time | 45.0% | Medium | 0.188126 |
| 684 | Redundant Connection | 57.4% | Medium | 0.187267 |
| 219 | Contains Duplicate II | 37.7% | Easy | 0.186968 |
| 792 | Number of Matching Subsequences | 47.4% | Medium | 0.185717 |
| 852 | Peak Index in a Mountain Array | 71.6% | Easy | 0.184963 |
| 536 | Construct Binary Tree from String | 48.3% | Medium | 0.181951 |
| 1153 | String Transforms Into Another String | 35.8% | Hard | 0.181698 |
| 1245 | Tree Diameter | 60.1% | Medium | 0.178691 |
| 871 | Minimum Number of Refueling Stops | 31.4% | Hard | 0.176930 |
| 486 | Predict the Winner | 47.9% | Medium | 0.176474 |
| 1027 | Longest Arithmetic Sequence | 53.4% | Medium | 0.175890 |
| 977 | Squares of a Sorted Array | 72.1% | Easy | 0.174821 |
| 523 | Continuous Subarray Sum | 24.6% | Medium | 0.174115 |
| 670 | Maximum Swap | 43.6% | Medium | 0.173594 |
| 1248 | Count Number of Nice Subarrays | 56.4% | Medium | 0.172283 |
| 561 | Array Partition I | 72.0% | Easy | 0.171809 |
| 856 | Score of Parentheses | 60.5% | Medium | 0.171358 |
| 707 | Design Linked List | 24.5% | Medium | 0.170432 |
| 1162 | As Far from Land as Possible | 43.5% | Medium | 0.169358 |
| 1430 | Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree | 44.8% | Medium | 0.169178 |
| 1026 | Maximum Difference Between Node and Ancestor | 66.0% | Medium | 0.167834 |
| 963 | Minimum Area Rectangle II | 50.9% | Medium | 0.166357 |
| 493 | Reverse Pairs | 25.2% | Hard | 0.162298 |
| 1048 | Longest String Chain | 54.7% | Medium | 0.162078 |
| 338 | Counting Bits | 69.5% | Medium | 0.161355 |
| 720 | Longest Word in Dictionary | 48.2% | Easy | 0.160827 |
| 404 | Sum of Left Leaves | 50.9% | Easy | 0.159116 |
| 724 | Find Pivot Index | 44.0% | Easy | 0.157730 |
| 539 | Minimum Time Difference | 51.5% | Medium | 0.156025 |
| 979 | Distribute Coins in Binary Tree | 68.9% | Medium | 0.153486 |
| 1242 | Web Crawler Multithreaded | 45.9% | Medium | 0.149531 |
| 1395 | Count Number of Teams | 82.0% | Medium | 0.149442 |
| 951 | Flip Equivalent Binary Trees | 65.8% | Medium | 0.148375 |
| 942 | DI String Match | 72.6% | Easy | 0.146379 |
| 213 | House Robber II | 36.5% | Medium | 0.144966 |
| 714 | Best Time to Buy and Sell Stock with Transaction Fee | 54.7% | Medium | 0.142773 |
| 376 | Wiggle Subsequence | 39.6% | Medium | 0.139234 |
| 673 | Number of Longest Increasing Subsequence | 35.7% | Medium | 0.138509 |
| 1005 | Maximize Sum Of Array After K Negations | 51.3% | Easy | 0.138044 |
| 855 | Exam Room | 43.1% | Medium | 0.138044 |
| 702 | Search in a Sorted Array of Unknown Size | 66.9% | Medium | 0.137832 |
| 429 | N-ary Tree Level Order Traversal | 65.0% | Medium | 0.137276 |
| 392 | Is Subsequence | 49.2% | Easy | 0.136352 |
| 1479 | Sales by Day of the Week | 83.4% | Hard | 0.134884 |
| 1160 | Find Words That Can Be Formed by Characters | 67.4% | Easy | 0.133674 |
| 309 | Best Time to Buy and Sell Stock with Cooldown | 47.4% | Medium | 0.130888 |
| 958 | Check Completeness of a Binary Tree | 52.1% | Medium | 0.128844 |
| 974 | Subarray Sums Divisible by K | 48.9% | Medium | 0.128381 |
| 1117 | Building H2O | 52.6% | Medium | 0.127969 |
| 1059 | All Paths from Source Lead to Destination | 44.7% | Medium | 0.126751 |
| 475 | Heaters | 33.1% | Easy | 0.126395 |
| 1233 | Remove Sub-Folders from the Filesystem | 59.5% | Medium | 0.124126 |
| 621 | Task Scheduler | 50.1% | Medium | 0.123879 |
| 890 | Find and Replace Pattern | 73.4% | Medium | 0.123613 |
| 912 | Sort an Array | 63.9% | Medium | 0.122937 |
| 654 | Maximum Binary Tree | 79.9% | Medium | 0.122342 |
| 1114 | Print in Order | 65.7% | Easy | 0.121360 |
| 784 | Letter Case Permutation | 64.6% | Medium | 0.120395 |
| 839 | Similar String Groups | 38.6% | Hard | 0.119346 |
| 904 | Fruit Into Baskets | 42.5% | Medium | 0.118848 |
| 1299 | Replace Elements with Greatest Element on Right Side | 75.4% | Easy | 0.118067 |
| 1179 | Reformat Department Table | 80.6% | Easy | 0.117350 |
| 144 | Binary Tree Preorder Traversal | 55.7% | Medium | 0.116763 |
| 679 | 24 Game | 46.4% | Hard | 0.116410 |
| 67 | Add Binary | 45.2% | Easy | 0.113490 |
| 671 | Second Minimum Node In a Binary Tree | 42.7% | Easy | 0.113435 |
| 1068 | Product Sales Analysis I | 83.1% | Easy | 0.112477 |
| 842 | Split Array into Fibonacci Sequence | 36.3% | Medium | 0.111848 |
| 196 | Delete Duplicate Emails | 41.1% | Easy | 0.111723 |
| 742 | Closest Leaf in a Binary Tree | 43.6% | Medium | 0.110609 |
| 966 | Vowel Spellchecker | 47.2% | Medium | 0.106767 |
| 249 | Group Shifted Strings | 55.1% | Medium | 0.106129 |
| 172 | Factorial Trailing Zeroes | 37.8% | Easy | 0.105825 |
| 1266 | Minimum Time Visiting All Points | 79.6% | Easy | 0.103827 |
| 396 | Rotate Function | 36.3% | Medium | 0.103451 |
| 267 | Palindrome Permutation II | 36.4% | Medium | 0.103451 |
| 485 | Max Consecutive Ones | 54.6% | Easy | 0.102478 |
| 27 | Remove Element | 48.2% | Easy | 0.102241 |
| 1110 | Delete Nodes And Return Forest | 67.0% | Medium | 0.099525 |
| 661 | Image Smoother | 51.5% | Easy | 0.099337 |
| 1023 | Camelcase Matching | 57.0% | Medium | 0.098601 |
| 461 | Hamming Distance | 72.8% | Easy | 0.097628 |
| 752 | Open the Lock | 51.8% | Medium | 0.094914 |
| 605 | Can Place Flowers | 31.6% | Easy | 0.094857 |
| 826 | Most Profit Assigning Work | 38.5% | Medium | 0.092874 |
| 367 | Valid Perfect Square | 41.7% | Easy | 0.090216 |
| 791 | Custom Sort String | 65.7% | Medium | 0.090049 |
| 216 | Combination Sum III | 56.6% | Medium | 0.087535 |
| 1247 | Minimum Swaps to Make Strings Equal | 60.1% | Medium | 0.086260 |
| 916 | Word Subsets | 47.8% | Medium | 0.084796 |
| 582 | Kill Process | 60.8% | Medium | 0.083555 |
| 921 | Minimum Add to Make Parentheses Valid | 73.7% | Medium | 0.083078 |
| 459 | Repeated Substring Pattern | 42.2% | Easy | 0.082992 |
| 278 | First Bad Version | 35.7% | Easy | 0.082959 |
| 884 | Uncommon Words from Two Sentences | 63.3% | Easy | 0.079900 |
| 875 | Koko Eating Bananas | 52.1% | Medium | 0.079197 |
| 705 | Design HashSet | 64.3% | Easy | 0.074972 |
| 674 | Longest Continuous Increasing Subsequence | 45.9% | Easy | 0.073936 |
| 1082 | Sales Analysis I | 71.8% | Easy | 0.071458 |
| 260 | Single Number III | 64.3% | Medium | 0.070562 |
| 1146 | Snapshot Array | 37.0% | Medium | 0.070176 |
| 953 | Verifying an Alien Dictionary | 54.1% | Easy | 0.068821 |
| 814 | Binary Tree Pruning | 74.5% | Medium | 0.068729 |
| 1337 | The K Weakest Rows in a Matrix | 68.8% | Easy | 0.068572 |
| 1495 | Friendly Movies Streamed Last Month | 52.6% | Easy | 0.068519 |
| 872 | Leaf-Similar Trees | 64.5% | Easy | 0.068315 |
| 584 | Find Customer Referee | 72.3% | Easy | 0.065921 |
| 1332 | Remove Palindromic Subsequences | 60.1% | Easy | 0.065813 |
| 1029 | Two City Scheduling | 56.1% | Easy | 0.063715 |
| 1251 | Average Selling Price | 81.6% | Easy | 0.062228 |
| 801 | Minimum Swaps To Make Sequences Increasing | 38.9% | Medium | 0.061463 |
| 1069 | Product Sales Analysis II | 82.9% | Easy | 0.060809 |
| 931 | Minimum Falling Path Sum | 62.5% | Medium | 0.059149 |
| 52 | N-Queens II | 57.9% | Hard | 0.058155 |
| 80 | Remove Duplicates from Sorted Array II | 44.0% | Medium | 0.057987 |
| 922 | Sort Array By Parity II | 69.3% | Easy | 0.057671 |
| 1221 | Split a String in Balanced Strings | 83.3% | Easy | 0.053626 |
| 1303 | Find the Team Size | 87.8% | Easy | 0.051557 |
| 1339 | Maximum Product of Splitted Binary Tree | 37.2% | Medium | 0.050643 |
| 1128 | Number of Equivalent Domino Pairs | 47.3% | Easy | 0.049515 |
| 1267 | Count Servers that Communicate | 57.9% | Medium | 0.049029 |
| 1051 | Height Checker | 71.1% | Easy | 0.045103 |
| 1382 | Balance a Binary Search Tree | 74.8% | Medium | 0.044800 |
| 1456 | Maximum Number of Vowels in a Substring of Given Length | 52.4% | Medium | 0.042200 |
| 704 | Binary Search | 52.1% | Easy | 0.041727 |
| 965 | Univalued Binary Tree | 67.7% | Easy | 0.041518 |
| 590 | N-ary Tree Postorder Traversal | 72.1% | Easy | 0.040454 |
| 1049 | Last Stone Weight II | 44.2% | Medium | 0.039029 |
| 797 | All Paths From Source to Target | 77.9% | Medium | 0.038811 |
| 1511 | Customer Order Frequency | 76.8% | Easy | 0.038392 |
| 606 | Construct String from Binary Tree | 54.1% | Easy | 0.037110 |
| 190 | Reverse Bits | 39.8% | Easy | 0.036452 |
| 1304 | Find N Unique Integers Sum up to Zero | 76.3% | Easy | 0.035408 |
| 1325 | Delete Leaves With a Given Value | 73.0% | Medium | 0.034786 |
| 1344 | Angle Between Hands of a Clock | 61.4% | Medium | 0.030822 |
| 501 | Find Mode in Binary Search Tree | 42.4% | Easy | 0.029808 |
| 303 | Range Sum Query – Immutable | 44.7% | Easy | 0.029549 |
| 665 | Non-decreasing Array | 19.5% | Easy | 0.029053 |
| 1520 | Maximum Number of Non-Overlapping Substrings | 32.8% | Hard | 0.021485 |
| 154 | Find Minimum in Rotated Sorted Array II | 41.6% | Hard | 0.018984 |
| 389 | Find the Difference | 55.3% | Easy | 0.016978 |
| 1365 | How Many Numbers Are Smaller Than the Current Number | 85.6% | Easy | 0.015926 |
| 1351 | Count Negative Numbers in a Sorted Matrix | 76.5% | Easy | 0.013016 |
| 1431 | Kids With the Greatest Number of Candies | 88.9% | Easy | 0.005927 |
| 663 | Equal Tree Partition | 39.5% | Medium | 0 |
| 537 | Complex Number Multiplication | 67.4% | Medium | 0 |
| 553 | Optimal Division | 56.8% | Medium | 0 |
| 645 | Set Mismatch | 42.1% | Easy | 0 |
| 738 | Monotone Increasing Digits | 44.3% | Medium | 0 |
| 776 | Split BST | 55.8% | Medium | 0 |
| 851 | Loud and Rich | 51.6% | Medium | 0 |
| 899 | Orderly Queue | 52.2% | Hard | 0 |
| 902 | Numbers At Most N Given Digit Set | 31.5% | Hard | 0 |
| 1067 | Digit Count in Range | 40.0% | Hard | 0 |
| 1065 | Index Pairs of a String | 60.7% | Easy | 0 |
| 1085 | Sum of Digits in the Minimum Number | 74.6% | Easy | 0 |
| 1118 | Number of Days in a Month | 57.4% | Easy | 0 |
| 1119 | Remove Vowels from a String | 89.9% | Easy | 0 |
| 1134 | Armstrong Number | 78.2% | Easy | 0 |
| 1028 | Recover a Tree From Preorder Traversal | 69.9% | Hard | 0 |
| 1133 | Largest Unique Number | 66.8% | Easy | 0 |
| 1035 | Uncrossed Lines | 56.1% | Medium | 0 |
| 1045 | Customers Who Bought All Products | 67.7% | Medium | 0 |
| 1050 | Actors and Directors Who Cooperated At Least Three Times | 71.7% | Easy | 0 |
| 1054 | Distant Barcodes | 43.2% | Medium | 0 |
| 1070 | Product Sales Analysis III | 48.9% | Medium | 0 |
| 1080 | Insufficient Nodes in Root to Leaf Paths | 49.3% | Medium | 0 |
| 1259 | Handshakes That Don’t Cross | 53.5% | Hard | 0 |
| 1288 | Remove Covered Intervals | 57.9% | Medium | 0 |
| 1129 | Shortest Path with Alternating Colors | 38.9% | Medium | 0 |
| 1362 | Closest Divisors | 56.8% | Medium | 0 |
| 1363 | Largest Multiple of Three | 33.5% | Hard | 0 |
| 1175 | Prime Arrangements | 51.0% | Easy | 0 |
| 1176 | Diet Plan Performance | 53.8% | Easy | 0 |
| 1255 | Maximum Score Words Formed by Letters | 69.4% | Hard | 0 |
| 1260 | Shift 2D Grid | 61.4% | Easy | 0 |
| 1305 | All Elements in Two Binary Search Trees | 76.1% | Medium | 0 |
| 1327 | List the Products Ordered in a Period | 76.4% | Easy | 0 |
| 1350 | Students With Invalid Departments | 89.5% | Easy | 0 |
| 1404 | Number of Steps to Reduce a Number in Binary Representation to One | 50.4% | Medium | 0 |
| 1408 | String Matching in an Array | 61.4% | Easy | 0 |
| 1409 | Queries on a Permutation With Key | 81.7% | Medium | 0 |
| 1421 | NPV Queries | 80.6% | Medium | 0 |
| 1457 | Pseudo-Palindromic Paths in a Binary Tree | 67.3% | Medium | 0 |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | 50.6% | Hard | 0 |
| 1496 | Path Crossing | 55.9% | Easy | 0 |
| 1485 | Clone Binary Tree With Random Pointer | 81.0% | Medium | 0 |
| 1502 | Can Make Arithmetic Progression From Sequence | 73.3% | Easy | 0 |
| 1490 | Clone N-ary Tree | 84.5% | Medium | 0 |
| 1533 | Find the Index of the Large Integer | 57.1% | Medium | 0 |
