| Apply Operations to Make Sum of Array Greater Than or Equal to k | Medium | 44.2% | 100.0% | MathGreedyEnumeration |
| Day of the Year | Easy | 49.6% | 97.7% | MathString |
| Largest Number After Digit Swaps by Parity | Easy | 65.0% | 97.7% | SortingHeap (Priority Queue) |
| Maximum Strong Pair XOR I | Easy | 75.9% | 97.7% | ArrayHash TableBit Manipulation+2 |
| Maximum Strong Pair XOR II | Hard | 32.2% | 97.7% | ArrayHash TableBit Manipulation+2 |
| Optimal Account Balancing | Hard | 50.3% | 89.3% | ArrayDynamic ProgrammingBacktracking+2 |
| Minimum Replacements to Sort the Array | Hard | 53.2% | 81.3% | ArrayMathGreedy |
| LRU Cache | Medium | 46.8% | 69.3% | Hash TableLinked ListDesign+1 |
| Minimum Increment to Make Array Unique | Medium | 60.6% | 69.3% | ArrayGreedySorting+1 |
| Integer to English Words | Hard | 34.8% | 59.7% | MathStringRecursion |
| Robot Bounded In Circle | Medium | 56.5% | 59.7% | MathStringSimulation |
| Number of Divisible Triplet Sums | Medium | 67.5% | 59.7% | ArrayHash Table |
| Word Ladder | Hard | 44.9% | 59.7% | Hash TableStringBreadth-First Search |
| Set Matrix Zeroes | Medium | 62.5% | 59.7% | ArrayHash TableMatrix |
| Reverse Nodes in k-Group | Hard | 65.4% | 59.7% | Linked ListRecursion |