| LFU Cache | Hard | 48.6% | 80.0% |
| Closest Equal Element Queries | Medium | 32.8% | 76.6% |
| Maximum Palindromes After Operations | Medium | 45.6% | 67.4% |
| LRU Cache | Medium | 46.8% | 67.4% |
| Maximum Number of Occurrences of a Substring | Medium | 54.3% | 67.4% |
| Minimize Malware Spread | Hard | 43.0% | 65.8% |
| Power Grid Maintenance | Medium | 56.3% | 64.2% |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 62.4% |
| Maximum Frequency Stack | Hard | 66.6% | 62.4% |
| Group Anagrams | Medium | 72.2% | 60.5% |
| Check Whether Two Strings are Almost Equivalent | Easy | 64.1% | 60.5% |
| Delete and Earn | Medium | 57.1% | 58.3% |
| Number of Divisible Triplet Sums | Medium | 67.5% | 53.2% |
| K-diff Pairs in an Array | Medium | 45.6% | 53.2% |
| Count Subarrays With Median K | Hard | 47.7% | 53.2% |
| All Nodes Distance K in Binary Tree | Medium | 67.4% | 53.2% |
| Two Sum | Easy | 57.1% | 50.1% |
| Report Spam Message | Medium | 48.5% | 50.1% |
| Minimum Window Substring | Hard | 47.0% | 46.4% |
| Top K Frequent Elements | Medium | 65.9% | 46.4% |
| Subarrays with K Different Integers | Hard | 67.6% | 41.9% |
| Odd String Difference | Easy | 61.8% | 41.9% |
| Word Ladder | Hard | 44.9% | 41.9% |
| Word Break | Medium | 49.1% | 36.1% |
| Top K Frequent Words | Medium | 60.0% | 36.1% |
| Missing Number | Easy | 71.7% | 36.1% |
| First Missing Positive | Hard | 42.5% | 36.1% |
| Reorganize String | Medium | 56.8% | 36.1% |
| Design Twitter | Medium | 44.2% | 36.1% |
| Subarray Sum Equals K | Medium | 46.8% | 28.2% |
| Construct Binary Tree from Preorder and Inorder Traversal | Medium | 68.4% | 28.2% |
| Integer to Roman | Medium | 70.5% | 28.2% |
| Roman to Integer | Easy | 66.3% | 28.2% |
| Maximum Number of Ways to Partition an Array | Hard | 35.6% | 28.2% |
| Maximum Earnings From Taxi | Medium | 46.2% | 28.2% |
| Least Number of Unique Integers after K Removals | Medium | 63.7% | 28.2% |
| Design Snake Game | Medium | 40.0% | 28.2% |
| Encode and Decode TinyURL | Medium | 86.6% | 28.2% |
| Using a Robot to Print the Lexicographically Smallest String | Medium | 62.5% | 28.2% |
| Lexicographically Minimum String After Removing Stars | Medium | 51.0% | 28.2% |
| Bus Routes | Hard | 47.1% | 28.2% |
| Find Duplicate Subtrees | Medium | 60.6% | 28.2% |
| Count Vowel Substrings of a String | Easy | 72.9% | 28.2% |
| Sort Characters By Frequency | Medium | 75.1% | 28.2% |
| Time Based Key-Value Store | Medium | 49.7% | 28.2% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 28.2% |
| Sliding Window Median | Hard | 38.9% | 28.2% |
