| LRU Cache | Medium | 46.8% | 100.0% |
| Two Sum | Easy | 57.1% | 88.4% |
| Valid Sudoku | Medium | 64.2% | 76.7% |
| Group Anagrams | Medium | 72.2% | 76.1% |
| Top K Frequent Elements | Medium | 65.9% | 76.1% |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 72.0% |
| Time Based Key-Value Store | Medium | 49.7% | 64.6% |
| Subarray Sum Equals K | Medium | 46.8% | 63.4% |
| Snapshot Array | Medium | 36.7% | 62.2% |
| Word Ladder | Hard | 44.9% | 59.5% |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 59.5% |
| Word Break | Medium | 49.1% | 58.1% |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 56.5% |
| Design Tic-Tac-Toe | Medium | 58.7% | 56.5% |
| Ransom Note | Easy | 65.7% | 56.5% |
| Max Points on a Line | Hard | 30.3% | 54.7% |
| Number of Squareful Arrays | Hard | 51.2% | 54.7% |
| Number of Pairs of Strings With Concatenation Equal to Target | Medium | 75.4% | 54.7% |
| Longest Consecutive Sequence | Medium | 47.0% | 52.8% |
| First Unique Character in a String | Easy | 65.1% | 52.8% |
| Calculate Score After Performing Instructions | Medium | 56.9% | 52.8% |
| Design HashMap | Easy | 66.4% | 52.8% |
| Task Scheduler | Medium | 62.7% | 48.4% |
| Letter Combinations of a Phone Number | Medium | 65.5% | 48.4% |
| Find Winner on a Tic Tac Toe Game | Easy | 54.5% | 48.4% |
| Roman to Integer | Easy | 66.3% | 42.6% |
| Find All Lonely Numbers in the Array | Medium | 62.7% | 39.0% |
| Valid Anagram | Easy | 67.8% | 39.0% |
| Missing Number | Easy | 71.7% | 39.0% |
| LFU Cache | Hard | 48.6% | 39.0% |
| Set Matrix Zeroes | Medium | 62.5% | 39.0% |
| Maximum Frequency Stack | Hard | 66.6% | 39.0% |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% | 39.0% |
| Design Memory Allocator | Medium | 49.7% | 34.7% |
| Binary Tree Vertical Order Traversal | Medium | 57.8% | 34.7% |
| Design Log Storage System | Medium | 59.3% | 34.7% |
| Happy Number | Easy | 59.3% | 34.7% |
| Find All Anagrams in a String | Medium | 53.3% | 34.7% |
| Intersection of Two Arrays | Easy | 77.5% | 29.1% |
| Determine if Two Strings Are Close | Medium | 54.2% | 29.1% |
| Intersection of Two Linked Lists | Easy | 63.2% | 29.1% |
| Word Ladder II | Hard | 27.5% | 29.1% |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 29.1% |
| Short Encoding of Words | Medium | 60.8% | 29.1% |
| Sudoku Solver | Hard | 65.4% | 29.1% |
| Contains Duplicate | Easy | 64.1% | 29.1% |
| Best Poker Hand | Easy | 61.6% | 29.1% |
| Logger Rate Limiter | Easy | 76.8% | 29.1% |
| Continuous Subarray Sum | Medium | 31.2% | 29.1% |
| Top K Frequent Words | Medium | 60.0% | 29.1% |
| Construct Binary Tree from Preorder and Postorder Traversal | Medium | 78.1% | 21.7% |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 21.7% |
| Design Task Manager | Medium | 49.1% | 21.7% |
| Permutation in String | Medium | 48.5% | 21.7% |
| All O`one Data Structure | Hard | 44.2% | 21.7% |
| Parse Lisp Expression | Hard | 53.5% | 21.7% |
| Find Distance in a Binary Tree | Medium | 74.3% | 21.7% |
| First Missing Positive | Hard | 42.5% | 21.7% |
| Minimum Window Substring | Hard | 47.0% | 21.7% |
| Copy List with Random Pointer | Medium | 62.4% | 21.7% |
| Similar String Groups | Hard | 56.1% | 21.7% |
| Verifying an Alien Dictionary | Easy | 55.9% | 21.7% |
| Word Pattern II | Medium | 48.8% | 21.7% |
| Clone Graph | Medium | 64.7% | 21.7% |
| Walking Robot Simulation | Medium | 58.4% | 21.7% |
| First Letter to Appear Twice | Easy | 74.9% | 21.7% |
| Sliding Window Median | Hard | 38.9% | 21.7% |
| Intersection of Three Sorted Arrays | Easy | 80.0% | 21.7% |
| Contains Duplicate II | Easy | 50.8% | 21.7% |
| Design Twitter | Medium | 44.2% | 21.7% |
| Longest Repeating Character Replacement | Medium | 59.1% | 21.7% |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 21.7% |
| Substring with Concatenation of All Words | Hard | 34.0% | 21.7% |
| Sentence Similarity II | Medium | 51.1% | 21.7% |
| Encode and Decode TinyURL | Medium | 86.6% | 21.7% |
