| Can Make Palindrome from Substring | Medium | 41.3% | 100.0% | ArrayHash TableString+2 |
| Delete and Earn | Medium | 57.1% | 100.0% | ArrayHash TableDynamic Programming |
| Increasing Decreasing String | Easy | 77.2% | 97.7% | Hash TableStringCounting |
| Number of Operations to Make Network Connected | Medium | 66.2% | 97.7% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Map Sum Pairs | Medium | 57.1% | 97.7% | Hash TableStringDesign+1 |
| Constrained Subsequence Sum | Hard | 56.4% | 97.7% | ArrayDynamic ProgrammingQueue+3 |
| Cherry Pickup | Hard | 39.1% | 97.7% | ArrayDynamic ProgrammingMatrix |
| Network Delay Time | Medium | 59.8% | 97.7% | Depth-First SearchBreadth-First SearchGraph Theory+2 |
| Minimum Number of Taps to Open to Water a Garden | Hard | 51.0% | 97.7% | ArrayDynamic ProgrammingGreedy |
| Create Sorted Array through Instructions | Hard | 41.4% | 97.7% | ArrayBinary SearchDivide and Conquer+4 |
| Minimum Initial Energy to Finish Tasks | Hard | 60.7% | 97.7% | ArrayGreedySorting |
| Reduce Array Size to The Half | Medium | 69.3% | 97.7% | ArrayHash TableGreedy+2 |
| Number of Different Subsequences GCDs | Hard | 45.0% | 97.7% | ArrayMathCounting+1 |
| Dice Roll Simulation | Hard | 50.7% | 97.7% | ArrayDynamic Programming |
| Maximum Star Sum of a Graph | Medium | 42.0% | 85.2% | ArrayGreedyGraph Theory+2 |
| Critical Connections in a Network | Hard | 59.3% | 58.3% | Depth-First SearchGraph TheoryBiconnected Component |