| Median of Two Sorted Arrays | Hard | 46.0% | 100.0% | ArrayBinary SearchDivide and Conquer |
| Design Spreadsheet | Medium | 74.3% | 79.7% | ArrayHash TableString+2 |
| Design Excel Sum Formula | Hard | 39.9% | 75.3% | ArrayHash TableString+4 |
| Merge k Sorted Lists | Hard | 58.9% | 75.3% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Evaluate Division | Medium | 64.0% | 66.0% | ArrayStringDepth-First Search+4 |
| Merge Two Sorted Lists | Easy | 68.0% | 66.0% | Linked ListRecursion |
| Number of Visible People in a Queue | Hard | 72.4% | 61.6% | ArrayStackMonotonic Stack |
| Optimal Account Balancing | Hard | 50.3% | 55.9% | ArrayDynamic ProgrammingBacktracking+2 |
| Maximize Amount After Two Days of Conversions | Medium | 61.2% | 55.9% | ArrayStringDepth-First Search+2 |
| Maximum Xor Product | Medium | 29.6% | 55.9% | MathGreedyBit Manipulation |
| Accounts Merge | Medium | 60.9% | 55.9% | ArrayHash TableString+4 |
| Synonymous Sentences | Medium | 57.1% | 55.9% | ArrayHash TableString+3 |
| Last Stone Weight | Easy | 66.3% | 48.0% | ArrayHeap (Priority Queue) |
| LFU Cache | Hard | 48.6% | 48.0% | Hash TableLinked ListDesign+1 |
| Merge Intervals | Medium | 51.2% | 48.0% | ArraySorting |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 48.0% | ArrayDynamic ProgrammingGreedy |
| Design Underground System | Medium | 74.4% | 48.0% | Hash TableStringDesign |
| Top K Frequent Elements | Medium | 65.9% | 48.0% | ArrayHash TableDivide and Conquer+5 |
| Sentence Similarity II | Medium | 51.1% | 48.0% | ArrayHash TableString+3 |
| Design a Text Editor | Hard | 50.1% | 48.0% | Linked ListStringStack+3 |
| Top K Frequent Words | Medium | 60.0% | 48.0% | ArrayHash TableString+5 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 48.0% | Hash TableStringSliding Window |
| LRU Cache | Medium | 46.8% | 48.0% | Hash TableLinked ListDesign+1 |