General skillEducation and learning

Yan-DP-Analysis

Analyze dynamic programming with state representation and last-difference decomposition.

Stars
1
Forks
0
License
Not publicly identified
Updated
Updated Jun 27, 2026

Checking live repository facts…

Project overview

This skill teaches a structured approach to dynamic programming: define the set of candidate solutions and its attribute, then partition by the last point of difference to derive a transition. It includes a reusable analysis template and examples for 0/1 knapsack, complete knapsack, interval DP, and longest common subsequence.

Repository facts

Primary language
Not detected
License
Not publicly identified
Repository updated
Jun 27, 2026
Default branch
main

Resource types

General skill

Use cases

Education and learning

Platforms

Claude Code, Codex, and more

Related projects

Browse more similar projects