Dynamic Programming Practice: 15 CPC Problems
Difference between en1 and en2, changed 0 character(s)
Hello everyone,↵
↵
[user:OmarAfterMidnight,2026-11-03] and I have put together a new Dynamic Programming contest on our Codeforces group.↵
↵
It includes 15 problems from CPCs around the world, arranged from basic to intermediate. The problems cover sequence and string DP, knapsack, interval DP, digit DP, and bitmask DP.↵
↵
Our group collects CPC problems by topic into focused practice contests. Each contest is arranged from easier to harder, and each problem includes its original contest source.↵
↵
The group currently has six sessions:↵
↵
- Session 1: Basics↵
- Session 2: Ad-Hocs↵
- Session 3: Binary Search on Answer↵
- Session 4: Number Theory↵
- Session 5: Range Queries↵
- Session 6: Dynamic Programming↵
↵
Explore the group: https://codeforces.me/group/frX7Y1bwYt↵
↵
And thanks to everyone interested.↵
↵
Example: Here is a problem from the session, with its original contest source.↵
↵
![Problem D: W-Pattern, originally from ECPC 2026 Qualifications Day 3](/predownloaded/cd/d6/cdd667393a2824e230aa15573db6a30511b17cb4.png)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English AdhamAfterMidnight 2026-11-03 17:23:09 0 (published)
en1 English AdhamAfterMidnight 2026-11-03 17:20:20 1083 Initial revision (saved to drafts)