| Construct Target Array With Multiple Sums | Hard | 36.8% | 100.0% | ArrayHeap (Priority Queue) |
| Encode Number | Medium | 70.3% | 87.5% | |
| 1-bit and 2-bit Characters | Easy | 49.5% | 87.5% | Array |
| Sort the Matrix Diagonally | Medium | 83.2% | 87.5% | ArraySortingMatrix |
| Maximum Number of Words You Can Type | Easy | 82.9% | 87.5% | Hash TableString |
| Range Frequency Queries | Medium | 42.1% | 87.5% | ArrayHash TableBinary Search+2 |
| Exam Room | Medium | 43.2% | 87.5% | DesignHeap (Priority Queue)Ordered Set |
| Subtract the Product and Sum of Digits of an Integer | Easy | 86.5% | 87.5% | Math |
| Find Numbers with Even Number of Digits | Easy | 79.6% | 87.5% | ArrayMath |
| Find the K-Beauty of a Number | Easy | 63.0% | 87.5% | MathStringSliding Window |
| 3Sum With Multiplicity | Medium | 46.2% | 87.5% | ArrayHash TableTwo Pointers+2 |
| Substrings of Size Three with Distinct Characters | Easy | 76.5% | 87.5% | Hash TableStringSliding Window+1 |
| Get Biggest Three Rhombus Sums in a Grid | Medium | 50.1% | 87.5% | ArrayMathSorting+3 |
| Finding Pairs With a Certain Sum | Medium | 61.6% | 87.5% | ArrayHash TableDesign |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 75.0% | ArrayHash TableMath+2 |
| Subarray Sum Equals K | Medium | 46.8% | 62.5% | ArrayHash TablePrefix Sum |
| Text Justification | Hard | 50.4% | 62.5% | ArrayStringSimulation |
| Longest Common Prefix | Easy | 47.1% | 62.5% | ArrayStringTrie |
| Number of Subarrays with Bounded Maximum | Medium | 54.7% | 50.0% | ArrayTwo Pointers |
| Serialize and Deserialize Binary Tree | Hard | 60.3% | 50.0% | StringTreeDepth-First Search+3 |