Daffodil International University
Judge online · C (gcc / clang)
DIU
ContestHub
C practice · live contests
Problems
Leaderboard
Contests
Log in
Register
Sets
/
Set 8
Set 08
Greedy Algorithms — Introduction
Seven problems, ramping from Very Easy to Extreme.
Progress · 0/7 solved
Q1
Maximum Coins (largest first)
VERY EASY
Q2
Activity Selection
EASY
Q3
Minimum Platforms
MEDIUM
Q4
Fractional Knapsack
MEDIUM-HARD
Q5
Job Sequencing with Deadlines
HARD
Q6
Huffman Encoding Total Length
VERY HARD
Q7
Gas Station Circular Tour
EXTREME
← Set 7
Set 9 →
Set 8 · Greedy Algorithms — Introduction · DIU ContestHub