| Maximum Number of Alloys | Medium | 40.2% | 100.0% | ArrayBinary Search |
| Reshape the Matrix | Easy | 64.7% | 100.0% | ArrayMatrixSimulation |
| Maximum Palindromes After Operations | Medium | 45.6% | 100.0% | ArrayHash TableString+3 |
| Total Cost to Hire K Workers | Medium | 43.5% | 100.0% | ArrayTwo PointersHeap (Priority Queue)+1 |
| Sell Diminishing-Valued Colored Balls | Medium | 30.1% | 100.0% | ArrayMathBinary Search+3 |
| Count Anagrams | Hard | 37.0% | 87.5% | Hash TableMathString+2 |
| Remove Colored Pieces if Both Neighbors are the Same Color | Medium | 63.0% | 87.5% | MathStringGreedy+1 |
| Last Substring in Lexicographical Order | Hard | 35.0% | 87.5% | Two PointersString |
| Minimum Cost Tree From Leaf Values | Medium | 67.8% | 87.5% | ArrayDynamic ProgrammingStack+2 |
| Earliest Second to Mark Indices II | Hard | 22.0% | 87.5% | ArrayBinary SearchGreedy+1 |
| Earliest Second to Mark Indices I | Medium | 36.4% | 87.5% | ArrayBinary Search |
| Count Subarrays With Fixed Bounds | Hard | 69.3% | 87.5% | ArrayQueueSliding Window+1 |
| Keyboard Row | Easy | 73.5% | 87.5% | ArrayHash TableString |
| Pass the Pillow | Easy | 56.6% | 87.5% | MathSimulation |
| Binary Tree Cameras | Hard | 47.6% | 87.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Shopping Offers | Medium | 52.2% | 87.5% | ArrayDynamic ProgrammingBacktracking+3 |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | 57.2% | 75.0% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+1 |
| Task Scheduler | Medium | 62.6% | 75.0% | ArrayHash TableGreedy+3 |
| String Transformation | Hard | 26.6% | 62.5% | MathStringDynamic Programming+1 |
| Reverse Nodes in k-Group | Hard | 65.3% | 62.5% | Linked ListRecursion |
| Number of Divisible Triplet Sums | Medium | 67.6% | 62.5% | |
| Minimum Equal Sum of Two Arrays After Replacing Zeros | Medium | 50.2% | 62.5% | ArrayGreedy |
| Split Array Largest Sum | Hard | 59.8% | 50.0% | ArrayBinary SearchDynamic Programming+2 |
| Break a Palindrome | Medium | 51.6% | 50.0% | StringGreedy |
| Maximum Difference Between Increasing Elements | Easy | 66.4% | 50.0% | Array |
| Convert Binary Number in a Linked List to Integer | Easy | 82.3% | 50.0% | Linked ListMath |
| Minimum Difficulty of a Job Schedule | Hard | 59.7% | 50.0% | ArrayDynamic Programming |
| Count Vowel Strings in Ranges | Medium | 67.8% | 50.0% | ArrayStringPrefix Sum |
| Find the Longest Equal Subarray | Medium | 37.6% | 50.0% | ArrayHash TableBinary Search+1 |
| Lexicographically Smallest Palindrome | Easy | 80.8% | 50.0% | Two PointersStringGreedy |
| Minimum Cost to Connect Sticks | Medium | 71.8% | 50.0% | |
| Count Vowels Permutation | Hard | 61.4% | 50.0% | Dynamic Programming |