Directi
8 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Minimum Cost to Buy Apples | Medium | 100% | TopicsArrayGraph TheoryHeap (Priority Queue)Shortest Path |
| Maximum XOR of Two Non-Overlapping Subtrees | Hard | 100% | TopicsTreeDepth-First SearchGraph TheoryTrie |
| 2538. Difference Between Maximum and Minimum Price Sum | Hard | 100% | TopicsArrayDynamic ProgrammingTreeDepth-First SearchDP on Trees |
| 1524. Number of Sub-arrays With Odd Sum | Medium | 100% | TopicsArrayMathDynamic ProgrammingPrefix Sum |
| 1535. Find the Winner of an Array Game | Medium | 100% | TopicsArraySimulation |
| 1542. Find Longest Awesome Substring | Hard | 100% | TopicsHash TableStringBit Manipulation |
| 1584. Min Cost to Connect All Points | Medium | 100% | TopicsArrayUnion-FindGraph TheoryMinimum Spanning TreePrim's AlgorithmKruskal's AlgorithmBorůvka's Algorithm |
| 1727. Largest Submatrix With Rearrangements | Medium | 100% | TopicsArrayGreedySortingMatrix |
