| Happy Number | Easy | 59.3% | 100.0% |
| Design In-Memory File System | Hard | 48.4% | 92.8% |
| Minimum Window Substring | Hard | 47.0% | 90.9% |
| Throne Inheritance | Medium | 66.9% | 83.7% |
| Find All Anagrams in a String | Medium | 53.3% | 80.7% |
| Count Vowel Substrings of a String | Easy | 72.9% | 77.3% |
| Find the Maximum Length of a Good Subsequence I | Medium | 32.5% | 75.3% |
| Minimum Array Length After Pair Removals | Medium | 27.1% | 75.3% |
| Find the Maximum Length of a Good Subsequence II | Hard | 25.1% | 73.2% |
| Design HashMap | Easy | 66.4% | 65.2% |
| Two Sum | Easy | 57.1% | 65.2% |
| Top K Frequent Elements | Medium | 65.9% | 61.7% |
| Time Based Key-Value Store | Medium | 49.7% | 57.6% |
| LRU Cache | Medium | 46.8% | 57.6% |
| Copy List with Random Pointer | Medium | 62.4% | 57.6% |
| Task Scheduler | Medium | 62.7% | 57.6% |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 52.7% |
| Design Log Storage System | Medium | 59.3% | 52.7% |
| Snapshot Array | Medium | 36.7% | 52.7% |
| Most Frequent IDs | Medium | 42.5% | 46.3% |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 46.3% |
| Roman to Integer | Easy | 66.3% | 46.3% |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.4% | 37.4% |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 37.4% |
| Alert Using Same Key-Card Three or More Times in a One Hour Period | Medium | 46.1% | 37.4% |
| Design File System | Medium | 65.1% | 37.4% |
