dynamic-programming-analysis · v1.1.0 · 2026-08-24 · sha256 9e15c4a556cbe689
dynamic-programming-analysis v1.1.0A
Immutable. This exact content never changes and is served at /api/v1/blob/9e15c4a556cbe689.
No tool to install first
claude plugin marketplace add https://markdownregistry.com/mp/a/art_b6ofhlbmolzhllrt/9e15c4a556cbe689e9c42365dc42de186a142430825d0414bf1a6ad929d1e457.json
Then /plugin install dynamic-programming-analysis@markdownregistry-b6ofhlbmolzhllrt in Claude Code. It installs this exact version, the one graded A here, pinned to the commit it was graded at, and leaves it there.
--- name: dynamic-programming-analysis description: > Use this skill whenever the user presents a problem, challenge, decision, or complex question that needs to be broken down into smaller, manageable sub-problems, just like dynamic programming in computer science. Triggers include: any problem that feels too big or overwhelming, strategic planning questions, optimization challenges (what is the best way to...), multi-step processes, decision trees, architectural designs, research questions, business or personal dilemmas, or any situation where the user says they do not know where to start. Always use this skill when decomposition, step-by-step reasoning, or structured problem-solving would help, even if the user does not mention dynamic programming explicitly. The goal is to model the DP mindset: identify base cases, define sub-problems, find overlapping structure, and build toward the solution bottom-up. metadata: author: Ronnasayd Machado - github.com/Ronnasayd version: "1.1.0" --- # Dynamic Programming Analysis Breaks any complex problem into DP-style sub-problems: **optimal substructure** (solution depends on smaller solutions) + **overlapping sub-problems** (recurring parts, solve once, reuse). Applies to business, personal decisions, architecture, research, learning, projects. ## Protocol | # | Step | Action | Gate | | --- | ------------------- | ----------------------------------------------------------------------------------- | ----------------------------------------------------- | | 1 | Define main problem | Restate precisely, final state, explicit/implicit constraints | — | | 2 | Decompose | Break into smaller parts; recurse until **base cases** (directly solvable) | tree structure, see `references/response-template.md` | | 3 | Identify overlaps | Which sub-problems recur across branches? Which partial solutions reuse? | mark explicitly — biggest efficiency win | | 4 | Resolution order | Base cases first, then by dependency (prereq before dependent) | execution sequence | | 5 | Solve each | Smallest → largest; compare options if multiple; note which parent problem it feeds | — | | 6 | Compose | Combine sub-solutions into original problem; validate fit | — | | 7 | Verify | Edge cases, external dependencies, optimal vs. good-enough | — | Respond using the template in `references/response-template.md`. ## Adaptations by problem type | Type | Sub-problem | Base case | Overlap | Composition | | ---------------------- | -------------------------- | ------------------------------------ | ------------------------------------------- | ------------------------- | | Decision | each criterion | verifiable facts, not opinions | criteria affecting multiple options | decision table/matrix | | Planning/Project | each deliverable/milestone | atomic task (1 person, 1 day) | shared deps between phases | schedule/roadmap | | Technical/Architecture | each component/module | primitive functions/services | reusable utilities/patterns | integration diagram | | Learning | each prerequisite concept | needs-no-prerequisite knowledge | fundamentals unlocking multiple topics | ordered learning path | | Business/Strategy | each strategic lever | observable metrics, concrete actions | capabilities supporting multiple strategies | integrated strategic plan | ## Quality principles - Granular: each sub-problem has a clear, direct answer. - No pseudo-decomposition: genuinely break down, don't just rename the problem. - Name dependencies explicitly (what depends on what). - Bottom-up only — solving big before small causes rework. - State reuse explicitly when one solution supports another. ## Reference files - `references/response-template.md` — verbatim markdown response template + sub-problem tree text format. - `references/example.md` — worked example (career transition into AI).