Media.net
39 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Trapping Rain Water II | Hard | 100% | TopicsArrayBreadth-First SearchHeap (Priority Queue)Matrix |
| 2538. Difference Between Maximum and Minimum Price Sum | Hard | 88.4% | TopicsArrayDynamic ProgrammingTreeDepth-First SearchDP on Trees |
| 2572. Count the Number of Square-Free Subsets | Medium | 86.4% | TopicsArrayMathDynamic ProgrammingBit ManipulationNumber TheoryBitmask |
| 1959. Minimum Total Space Wasted With K Resizing Operations | Medium | 81.8% | TopicsArrayDynamic ProgrammingPrefix Sum |
| 1938. Maximum Genetic Difference Query | Hard | 79.2% | TopicsArrayHash TableBit ManipulationDepth-First SearchTrie |
| Minimum Cost to Buy Apples | Medium | 79.2% | TopicsArrayGraph TheoryHeap (Priority Queue)Shortest Path |
| Maximum XOR of Two Non-Overlapping Subtrees | Hard | 79.2% | TopicsTreeDepth-First SearchGraph TheoryTrie |
| Sum of Remoteness of All Cells | Medium | 79.2% | TopicsArrayHash TableDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| 2874. Maximum Value of an Ordered Triplet II | Medium | 79.2% | TopicsArrayPrefix Sum |
| 2873. Maximum Value of an Ordered Triplet I | Easy | 79.2% | TopicsArrayPrefix Sum |
| 1642. Furthest Building You Can Reach | Medium | 79.2% | TopicsArrayGreedyHeap (Priority Queue) |
| 1222. Queens That Can Attack the King | Medium | 79.2% | TopicsArrayMatrixSimulation |
| 1266. Minimum Time Visiting All Points | Easy | 79.2% | TopicsArrayMathGeometry |
| 1787. Make the XOR of All Segments Equal to Zero | Hard | 79.2% | TopicsArrayHash TableDynamic ProgrammingBit ManipulationCounting |
| 1879. Minimum XOR Sum of Two Arrays | Hard | 79.2% | TopicsArrayDynamic ProgrammingBit ManipulationBitmaskHungarian AlgorithmBipartite GraphSuccessive Shortest Path Algorithm |
| 2835. Minimum Operations to Form Subsequence With Target Sum | Hard | 79.2% | TopicsArrayGreedyBit Manipulation |
| 3660. Jump Game IX | Medium | 79.2% | TopicsArrayDynamic Programming |
| 4051. Count Subarrays with Distant Sums | Hard | 79.2% | TopicsArrayBinary SearchBinary Indexed TreeSegment TreePrefix Sum |
| 4059. Lexicographically Largest Power Array | Hard | 79.2% | TopicsArrayGreedyBit Manipulation |
| 42. Trapping Rain Water | Hard | 76.1% | TopicsArrayTwo PointersDynamic ProgrammingStackMonotonic Stack |
| Russian Doll Envelopes | Hard | 76.1% | TopicsArrayBinary SearchDynamic ProgrammingSortingLongest Increasing Subsequence |
| 947. Most Stones Removed with Same Row or Column | Medium | 68.5% | TopicsHash TableDepth-First SearchUnion-FindGraph TheoryBipartite Graph |
| 2382. Maximum Segment Sum After Removals | Hard | 56.9% | TopicsArrayUnion-FindPrefix SumOrdered Set |
| Kth Smallest Number in Multiplication Table | Hard | 56.9% | TopicsMathBinary Search |
| 2945. Find Maximum Non-decreasing Array Length | Hard | 56.9% | TopicsArrayBinary SearchDynamic ProgrammingStackQueueMonotonic StackPrefix SumMonotonic Queue |
