| Maximum Coins Heroes Can Collect | Medium | 68.7% | 100.0% | |
| The Time When the Network Becomes Idle | Medium | 55.3% | 100.0% | ArrayBreadth-First SearchGraph Theory |
| Smallest K-Length Subsequence With Occurrences of a Letter | Hard | 39.6% | 100.0% | StringStackGreedy+1 |
| Apply Operations to Maximize Frequency Score | Hard | 38.5% | 100.0% | ArrayBinary SearchSliding Window+2 |
| Maximum Running Time of N Computers | Hard | 56.4% | 100.0% | ArrayBinary SearchGreedy+1 |
| Pour Water Between Buckets to Make Water Levels Equal | Medium | 68.2% | 100.0% | |
| Find the Maximum Sum of Node Values | Hard | 69.5% | 100.0% | ArrayDynamic ProgrammingGreedy+3 |
| Minimum Operations to Make the Array Increasing | Easy | 81.8% | 100.0% | ArrayGreedy |
| Minimum Operations to Collect Elements | Easy | 62.2% | 100.0% | ArrayHash TableBit Manipulation |
| Collecting Chocolates | Medium | 34.7% | 75.0% | ArrayEnumeration |
| Different Ways to Add Parentheses | Medium | 73.1% | 75.0% | MathStringDynamic Programming+2 |
| Two Sum | Easy | 57.1% | 62.5% | ArrayHash Table |
| Longest Common Prefix | Easy | 47.1% | 62.5% | ArrayStringTrie |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 62.5% | ArrayDynamic Programming |
| Best Time to Buy and Sell Stock II | Medium | 70.7% | 62.5% | ArrayDynamic ProgrammingGreedy |
| Squares of a Sorted Array | Easy | 73.6% | 62.5% | ArrayTwo PointersSorting |
| N-Queens II | Hard | 78.1% | 62.5% | Backtracking |
| Pascal's Triangle | Easy | 78.7% | 62.5% | ArrayDynamic Programming |
| Split Array With Same Average | Hard | 26.8% | 62.5% | ArrayHash TableMath+3 |
| Count Increasing Quadruplets | Hard | 34.5% | 62.5% | ArrayDynamic ProgrammingBinary Indexed Tree+2 |
| Coin Change | Medium | 47.9% | 62.5% | ArrayDynamic ProgrammingBreadth-First Search |