Daffodil International University
Judge online · C (gcc / clang)
DIU
ContestHub
C practice · live contests
Problems
Leaderboard
Contests
Log in
Register
Sets
/
Set 13
Set 13
Dynamic Programming — Introduction
Seven problems, ramping from Very Easy to Extreme.
Progress · 0/7 solved
Q1
Fibonacci (DP, not recursion)
VERY EASY
Q2
Climbing Stairs
EASY
Q3
0/1 Knapsack
MEDIUM
Q4
Longest Increasing Subsequence
MEDIUM-HARD
Q5
Edit Distance
HARD
Q6
Maximum Sum Increasing Subsequence with Reconstruction
VERY HARD
Q7
Optimal Binary Search Tree Cost
EXTREME
← Set 12
Set 14 →
Set 13 · Dynamic Programming — Introduction · DIU ContestHub