| Sum of Distances | Medium | 32.5% | 100.0% | ArrayHash TablePrefix Sum |
| Minimize Length of Array Using Operations | Medium | 35.7% | 100.0% | ArrayMathGreedy+1 |
| Count Visited Nodes in a Directed Graph | Hard | 30.3% | 100.0% | Dynamic ProgrammingDepth-First SearchGraph Theory+2 |
| Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | Medium | 41.4% | 100.0% | ArrayGreedySorting |
| Minimize Malware Spread | Hard | 43.0% | 77.8% | ArrayHash TableDepth-First Search+3 |
| Car Fleet | Medium | 54.8% | 70.8% | ArrayStackSorting+1 |
| Bitwise ORs of Subarrays | Medium | 56.8% | 70.8% | ArrayDynamic ProgrammingBit Manipulation |
| Kth Largest Element in an Array | Medium | 68.8% | 70.8% | ArrayDivide and ConquerSorting+2 |
| Group Anagrams | Medium | 72.2% | 61.0% | ArrayHash TableString+1 |
| Find the Count of Monotonic Pairs II | Hard | 24.6% | 61.0% | ArrayMathDynamic Programming+2 |
| 3Sum | Medium | 38.6% | 61.0% | ArrayTwo PointersSorting |
| Count Number of Maximum Bitwise-OR Subsets | Medium | 89.6% | 61.0% | ArrayBacktrackingBit Manipulation+1 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 61.0% | ArrayDynamic Programming |
| Merge Sorted Array | Easy | 54.4% | 61.0% | ArrayTwo PointersSorting |
| Palindromic Substrings | Medium | 72.6% | 61.0% | Two PointersStringDynamic Programming |
| Count Good Subarrays | Hard | | 61.0% | ArrayStackBit Manipulation+1 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 61.0% | Hash TableStringSliding Window |