| Count Subarrays With Fixed Bounds | Hard | 69.2% | 100.0% | ArrayQueueSliding Window+1 |
| Maximum Number of Alloys | Medium | 40.3% | 98.5% | ArrayBinary Search |
| Sell Diminishing-Valued Colored Balls | Medium | 30.1% | 91.2% | ArrayMathBinary Search+3 |
| Total Cost to Hire K Workers | Medium | 43.5% | 91.2% | ArrayTwo PointersHeap (Priority Queue)+1 |
| Reshape the Matrix | Easy | 64.7% | 91.2% | ArrayMatrixSimulation |
| Binary Tree Cameras | Hard | 47.6% | 88.9% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Shopping Offers | Medium | 52.3% | 88.9% | ArrayDynamic ProgrammingBacktracking+3 |
| Earliest Second to Mark Indices I | Medium | 36.5% | 88.9% | ArrayBinary Search |
| Earliest Second to Mark Indices II | Hard | 22.0% | 88.9% | ArrayBinary SearchGreedy+1 |
| Maximum Palindromes After Operations | Medium | 45.6% | 88.9% | ArrayHash TableString+3 |
| Keyboard Row | Easy | 73.6% | 88.9% | ArrayHash TableString |
| Last Substring in Lexicographical Order | Hard | 35.0% | 88.9% | Two PointersString |
| Count Anagrams | Hard | 37.0% | 88.9% | Hash TableMathString+2 |
| Minimum Cost Tree From Leaf Values | Medium | 67.8% | 88.9% | ArrayDynamic ProgrammingStack+2 |
| Remove Colored Pieces if Both Neighbors are the Same Color | Medium | 63.0% | 88.9% | MathStringGreedy+1 |
| Pass the Pillow | Easy | 56.6% | 80.5% | MathSimulation |
| String Transformation | Hard | 26.7% | 80.5% | MathStringDynamic Programming+1 |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.3% | 72.6% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+1 |
| Number of Divisible Triplet Sums | Medium | 67.5% | 60.7% | ArrayHash Table |
| Longest String Chain | Medium | 62.8% | 60.7% | ArrayHash TableTwo Pointers+3 |
| Sum of Distances in Tree | Hard | 65.5% | 60.7% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Split Array Largest Sum | Hard | 59.9% | 60.7% | ArrayBinary SearchDynamic Programming+2 |
| Distinct Subsequences | Hard | 51.5% | 51.2% | StringDynamic Programming |
| Reverse Nodes in k-Group | Hard | 65.4% | 51.2% | Linked ListRecursion |
| Beautiful Arrangement | Medium | 64.7% | 51.2% | ArrayDynamic ProgrammingBacktracking+2 |
| Convert Binary Number in a Linked List to Integer | Easy | 82.3% | 51.2% | Linked ListMath |
| Break a Palindrome | Medium | 51.6% | 51.2% | StringGreedy |
| Maximum Difference Between Increasing Elements | Easy | 66.5% | 51.2% | Array |
| Longest Repeating Character Replacement | Medium | 59.1% | 51.2% | Hash TableStringSliding Window |