| All O`one Data Structure | Hard | 44.2% | 94.4% |
| Word Ladder | Hard | 44.9% | 79.1% |
| Design Authentication Manager | Medium | 58.4% | 77.8% |
| Shortest Word Distance II | Medium | 62.7% | 77.4% |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 69.3% |
| Minimum Window Substring | Hard | 47.0% | 64.8% |
| Letter Combinations of a Phone Number | Medium | 65.5% | 63.0% |
| Isomorphic Strings | Easy | 48.1% | 62.1% |
| Max Points on a Line | Hard | 30.3% | 58.8% |
| Repeated DNA Sequences | Medium | 52.9% | 57.6% |
| LRU Cache | Medium | 46.8% | 56.3% |
| Two Sum | Easy | 57.1% | 53.4% |
| Sparse Matrix Multiplication | Medium | 69.2% | 53.4% |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 50.0% |
| Create Binary Tree From Descriptions | Medium | 81.7% | 50.0% |
| Two Sum III - Data structure design | Easy | 39.1% | 50.0% |
| Accounts Merge | Medium | 60.9% | 49.0% |
| Design HashMap | Easy | 66.4% | 47.4% |
| Number of Divisible Triplet Sums | Medium | 67.5% | 45.3% |
| Cinema Seat Allocation | Medium | 43.6% | 40.9% |
| Lowest Common Ancestor of a Binary Tree III | Medium | 82.9% | 40.9% |
| Task Scheduler | Medium | 62.7% | 40.9% |
| Word Ladder II | Hard | 27.5% | 40.5% |
| Intersection of Two Linked Lists | Easy | 63.2% | 39.7% |
| Valid Sudoku | Medium | 64.2% | 37.4% |
| Intersection of Two Arrays | Easy | 77.5% | 33.0% |
| Integer to Roman | Medium | 70.5% | 33.0% |
| Largest Color Value in a Directed Graph | Hard | 57.3% | 32.0% |
| Dot Product of Two Sparse Vectors | Medium | 89.9% | 32.0% |
| Partition Labels | Medium | 81.8% | 32.0% |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 27.8% |
