Set 15
Advanced Greedy + Prefix Sums
Seven problems, ramping from Very Easy to Extreme.
Progress · 0/7 solved
- VERY EASYQ1Maximize Sum of Pairs (fixed pairs)
- EASYQ2Maximum Sum of Chosen Subset's Adjacent Differences
- MEDIUMQ3World T20 X Team (full version)
- MEDIUM-HARDQ4Minimum Cost to Connect Sticks (via extremes, priority-queue idea)
- HARDQ5Balanced Partition (Minimize Difference)
- VERY HARDQ6Task Scheduling with Cooldown (greedy + counting)
- EXTREMEQ7World T20 X Team, Offline with Point Updates (hardest variant)