| Two Sum | Easy | 57.1% | 100.0% |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 79.4% |
| Group Anagrams | Medium | 72.2% | 69.8% |
| Roman to Integer | Easy | 66.3% | 68.3% |
| Set Matrix Zeroes | Medium | 62.5% | 62.9% |
| Letter Combinations of a Phone Number | Medium | 65.5% | 62.5% |
| First Missing Positive | Hard | 42.5% | 54.6% |
| Integer to Roman | Medium | 70.5% | 52.2% |
| Happy Number | Easy | 59.3% | 51.9% |
| Subarray Sum Equals K | Medium | 46.8% | 50.3% |
| Contains Duplicate | Easy | 64.1% | 50.3% |
| Intersection of Two Linked Lists | Easy | 63.2% | 50.3% |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 50.3% |
| Longest Consecutive Sequence | Medium | 47.0% | 50.3% |
| Next Greater Element I | Easy | 75.8% | 50.3% |
| Maximum Difference Between Even and Odd Frequency I | Easy | 60.7% | 50.3% |
| LRU Cache | Medium | 46.8% | 50.3% |
| Valid Sudoku | Medium | 64.2% | 50.2% |
| Sudoku Solver | Hard | 65.4% | 48.8% |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.4% | 47.7% |
| Intersection of Two Arrays | Easy | 77.5% | 47.2% |
| Word Ladder | Hard | 44.9% | 47.2% |
| Minimum Window Substring | Hard | 47.0% | 41.4% |
| Design Tic-Tac-Toe | Medium | 58.7% | 41.2% |
| Majority Element | Easy | 66.1% | 41.2% |
| Word Break | Medium | 49.1% | 41.2% |
| Ransom Note | Easy | 65.7% | 41.2% |
| Valid Anagram | Easy | 67.8% | 36.0% |
| Isomorphic Strings | Easy | 48.1% | 36.0% |
| Set Mismatch | Easy | 44.2% | 32.8% |
| Contains Duplicate II | Easy | 50.8% | 32.8% |
| Construct Binary Tree from Inorder and Postorder Traversal | Medium | 68.1% | 32.8% |
| Copy List with Random Pointer | Medium | 62.4% | 30.3% |
| Linked List Cycle | Easy | 53.9% | 30.3% |
| Substring with Concatenation of All Words | Hard | 34.0% | 26.7% |
| Missing Number | Easy | 71.7% | 22.6% |
