Yan-DP-Analysis
Analyze dynamic programming with state representation and last-difference decomposition.
- Stars
- 1
- Forks
- 0
- Updated
- Updated Jun 27, 2026
Analyze dynamic programming with state representation and last-difference decomposition.
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.
Resource types
Use cases
Platforms
Public GitHub facts last synced Jul 10, 2026.
Build durable understanding with retrieval practice and spaced review.
Review undergraduate theses across six weighted dimensions
Learn to build Claude skills through a five-level guided tutor
A Chinese prompt framework that turns complex learning material into a seven-layer Obsidian Canvas.