| Difference Between Maximum and Minimum Price Sum | Hard | 33.3% | 100.0% | ArrayDynamic ProgrammingTree+1 |
| Find Longest Awesome Substring | Hard | 46.6% | 100.0% | Hash TableStringBit Manipulation |
| Min Cost to Connect All Points | Medium | 70.4% | 100.0% | ArrayUnion-FindGraph Theory+1 |
| Maximum XOR of Two Non-Overlapping Subtrees | Hard | 52.1% | 100.0% | TreeDepth-First SearchGraph Theory+1 |
| Minimum Cost to Buy Apples | Medium | 67.3% | 100.0% | ArrayGraph TheoryHeap (Priority Queue)+1 |
| Largest Submatrix With Rearrangements | Medium | 75.2% | 100.0% | ArrayGreedySorting+1 |
| Find the Winner of an Array Game | Medium | 56.8% | 100.0% | ArraySimulation |
| Number of Sub-arrays With Odd Sum | Medium | 55.8% | 100.0% | ArrayMathDynamic Programming+1 |