Description
Practice DP and some of advanced DP techniques:
- DP on trees
- DP bitmask
- Convex hull trick on DP
- DP on broken profiles*
I also added some greedy problems for you to practice distinguishing DP vs greedy
*NB: I can't find DP on broken profile on kattis yet. Meanwhile, try solving this: https://codeforces.com/problemset/problem/845/F
Start & End Times
| Start Time | 2025-09-12 16:00 CEST |
| End time | 2025-09-19 16:00 CEST |
Problems
Scoring
Pass/Fail — Unranked
Explanation:
Each problem is pass/fail. Participants are not ranked
Standings
- Standings are shown without limitation.
Languages
Ada Algol 60 Algol 68 APL Bash BCPL BQN C C# C++ COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Fortran 77 Gerbil Go Haskell Icon Java JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP PL/I Prolog Python 2 Python 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig