AtCoder Educational DP Contest

Welcome to the AtCoder Educational DP Contest section! This is a comprehensive collection of 26 dynamic programming problems designed to teach and reinforce various DP techniques.

View Summary →

Quick Links

Basic Problems (A-E)

• A - Frog 1
• B - Frog 2
• C - Vacation
• D - Knapsack 1
• E - Knapsack 2

Intermediate Problems (G-M)

• G - Longest Path
• H - Grid 1
• I - Coins
• J - Sushi
• K - Stones
• L - Deque
• M - Candies

Advanced Problems (N-Z)

• N - Slimes
• O - Matching
• P - Independent Set
• Q - Flowers
• R - Walk
• S - Digit Sum
• T - Permutation
• U - Grouping
• V - Subtree
• W - Intervals
• X - Tower
• Y - Grid 2
• Z - Frog 3

---

Note: Problem F (LCS - Longest Common Subsequence) is covered in the main Dynamic Programming section.