dynamic-programming
CommunityMaster DP with memoized, optimal solutions.
AuthorSPIRAL-EDWIN
Version1.0.0
Installs0
System Documentation
What problem does it solve?
Dynamic programming solves multi-stage optimization by breaking problems into overlapping subproblems and caching results.
Core Features & Use Cases
- Memoization: stores subproblem results to avoid recomputation.
- State Definition & Transitions: defines dp states and recurrence relations for classic problems like knapsack, shortest path, and coin change.
- Use Case: implement DP to optimize resource allocation or sequence alignment with minimal computation.
Quick Start
Run the classic knapsack example with weights [2,3,4,5], values [3,4,5,6], capacity 8 to obtain a maximum value of 10.
Dependency Matrix
Required Modules
None requiredComponents
Standard package💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: dynamic-programming Download link: https://github.com/SPIRAL-EDWIN/MCM-ICM-2601000/archive/main.zip#dynamic-programming Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 223,000+ vetted skills library on demand.