| Bus Routes | Hard | 47.1% | 100.0% |
| Number of Islands II | Hard | 40.4% | 88.0% |
| First Unique Number | Medium | 57.0% | 81.0% |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 76.9% |
| LRU Cache | Medium | 46.8% | 76.9% |
| Count Paths That Can Form a Palindrome in a Tree | Hard | 48.4% | 70.2% |
| Valid Sudoku | Medium | 64.2% | 64.8% |
| Letter Combinations of a Phone Number | Medium | 65.5% | 62.7% |
| Group Anagrams | Medium | 72.2% | 62.7% |
| Top K Frequent Words | Medium | 60.0% | 62.7% |
| Design In-Memory File System | Hard | 48.4% | 61.5% |
| Word Break | Medium | 49.1% | 61.5% |
| Two Sum | Easy | 57.1% | 58.9% |
| Top K Frequent Elements | Medium | 65.9% | 57.5% |
| Minimum Window Substring | Hard | 47.0% | 57.5% |
| Valid Anagram | Easy | 67.8% | 57.5% |
| Minimum Number of Operations to Make Array Continuous | Hard | 52.1% | 57.5% |
| Roman to Integer | Easy | 66.3% | 56.0% |
| All O`one Data Structure | Hard | 44.2% | 56.0% |
| Time Based Key-Value Store | Medium | 49.7% | 54.4% |
| Sudoku Solver | Hard | 65.4% | 54.4% |
| Replace Words | Medium | 68.6% | 54.4% |
| Meeting Rooms III | Hard | 51.6% | 52.6% |
| Minimum Operations to Write the Letter Y on a Grid | Medium | 64.3% | 52.6% |
| Encode and Decode TinyURL | Medium | 86.6% | 52.6% |
| Points That Intersect With Cars | Easy | 73.4% | 52.6% |
| Regions Cut By Slashes | Medium | 77.5% | 52.6% |
| Word Break II | Hard | 55.1% | 50.6% |
| Happy Number | Easy | 59.3% | 50.6% |
| Remove Zero Sum Consecutive Nodes from Linked List | Medium | 53.1% | 50.6% |
| Create Binary Tree From Descriptions | Medium | 81.7% | 50.6% |
| Clone Graph | Medium | 64.7% | 50.6% |
| Copy List with Random Pointer | Medium | 62.4% | 50.6% |
| Palindrome Permutation | Easy | 68.6% | 50.6% |
| Random Pick with Blacklist | Hard | 34.6% | 50.6% |
| Intersection of Multiple Arrays | Easy | 68.6% | 50.6% |
| Number Of Ways To Reconstruct A Tree | Hard | 45.5% | 50.6% |
| Word Pattern | Easy | 43.8% | 50.6% |
| Word Pattern II | Medium | 48.8% | 50.6% |
| K Divisible Elements Subarrays | Medium | 54.8% | 50.6% |
| Employee Importance | Medium | 69.3% | 50.6% |
| Match Alphanumerical Pattern in Matrix I | Medium | 64.2% | 50.6% |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 50.6% |
| Construct K Palindrome Strings | Medium | 68.6% | 50.6% |
| Number of Nodes in the Sub-Tree With the Same Label | Medium | 55.4% | 50.6% |
| Group Shifted Strings | Medium | 67.7% | 50.6% |
| Open the Lock | Medium | 61.2% | 48.5% |
| Number of Black Blocks | Medium | 41.5% | 48.5% |
| Minimum Cost to Equalize Arrays Using Swaps | Medium | | 48.5% |
| Word Ladder | Hard | 44.9% | 46.1% |
| Find All Possible Recipes from Given Supplies | Medium | 56.8% | 43.4% |
| Subarray Sums Divisible by K | Medium | 56.1% | 43.4% |
| Number of Matching Subsequences | Medium | 50.6% | 40.3% |
| Design Memory Allocator | Medium | 49.7% | 40.3% |
| Longest Consecutive Sequence | Medium | 47.0% | 40.3% |
| Verifying an Alien Dictionary | Easy | 55.9% | 40.3% |
| LFU Cache | Hard | 48.6% | 36.6% |
| Task Scheduler | Medium | 62.7% | 36.6% |
| Subarrays with K Different Integers | Hard | 67.6% | 32.2% |
| Design File System | Medium | 65.1% | 32.2% |
| Smallest String With Swaps | Medium | 60.4% | 32.2% |
| Word Ladder II | Hard | 27.5% | 32.2% |
| Count Nice Pairs in an Array | Medium | 48.4% | 32.2% |
| Maximum Earnings From Taxi | Medium | 46.2% | 32.2% |
| Subarray Sum Equals K | Medium | 46.8% | 32.2% |
| Number of Flowers in Full Bloom | Hard | 57.7% | 32.2% |
| Find the Length of the Longest Common Prefix | Medium | 57.0% | 32.2% |
| Minimum Jumps to Reach End via Prime Teleportation | Medium | 31.8% | 26.6% |
| Design A Leaderboard | Medium | 68.1% | 26.6% |
| Longest Repeating Character Replacement | Medium | 59.1% | 26.6% |
| Count the Number of Good Subarrays | Medium | 65.9% | 26.6% |
| Maximum Frequency Stack | Hard | 66.6% | 26.6% |
| Analyze User Website Visit Pattern | Medium | 44.2% | 26.6% |
| Number of Wonderful Substrings | Medium | 66.6% | 19.2% |
| Rearranging Fruits | Hard | 57.5% | 19.2% |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 19.2% |
| Simple Bank System | Medium | 69.8% | 19.2% |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 19.2% |
| Next Greater Element I | Easy | 75.8% | 19.2% |
| Minimize Malware Spread | Hard | 43.0% | 19.2% |
| Minimize Malware Spread II | Hard | 45.5% | 19.2% |
| Design Snake Game | Medium | 40.0% | 19.2% |
| Maximum Manhattan Distance After K Changes | Medium | 54.2% | 19.2% |
| Linked List Components | Medium | 57.8% | 19.2% |
| Set Matrix Zeroes | Medium | 62.5% | 19.2% |
| Insert Delete GetRandom O(1) - Duplicates allowed | Hard | 36.4% | 19.2% |
| Accounts Merge | Medium | 60.9% | 19.2% |
| Design Twitter | Medium | 44.2% | 19.2% |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 19.2% |
| Find All Anagrams in a String | Medium | 53.3% | 19.2% |
