knoopx/dynamic-programming
agent/skills/knowledge/dynamic-programming/SKILL.md
Solve problems with overlapping subproblems and optimal substructure using memoization or tabulation. Use when finding minimum cost, counting ways, or computing longest/shortest subsequences.
$ install --global
skillsauthnpx skillsauth add knoopx/pi dynamic-programmingInstall this skill globally with one command. Works with Claude Code, Cursor, and Windsurf.
Security Scan Results
3 of 9 scanners reported clean
Some scanners were skipped, did not run, or reported a non-clean status. Review each row below.
3
Scanners Passed
9
Scanners in report
Clean
TrivyContainer and dependency vulnerability scanner
95%
Clean
SemgrepStatic code analysis for vulnerabilities
95%
Clean
mcp-scan (Snyk)Model Context Protocol security validation
95%
Skipped
Snyk (dep)Open source security scanning
50%
Skipped
Socket.devSupply chain security analysis
50%
Skipped
VirusTotalMulti-engine malware detection
50%
Skipped
CrowdStrikeAdvanced threat intelligence
50%
Skipped
OSV-ScannerOpen Source Vulnerability database check
50%
Skipped
OWASP Dep-Check
50%
Last scanned: May 18, 2026, 6:36 AM120.0s1 file scanned
SKILL.md
- name:
- dynamic-programming
- description:
- Solve problems with overlapping subproblems and optimal substructure using memoization or tabulation. Use when finding minimum cost, counting ways, or computing longest/shortest subsequences.
- topic:
- Dynamic Programming
- token_cost:
- 110
- related:
- [bfs-state-space, recursion-backtracking]
When to use
Use dynamic programming when a problem has overlapping subproblems (same computation repeated) and optimal substructure (optimal solution built from optimal sub-solutions).
Signs
"find minimum cost," "count the number of ways," "longest/shortest subsequence," "can you reach."
Rules
- Define state (what changes between subproblems) and recurrence (how states relate)
- Top-down with @cache is easiest to write; bottom-up tabulation avoids recursion limits and is often faster
- ALWAYS check if you can reduce space by keeping only the previous row/state instead of the full table
- NEVER memoize without verifying overlapping subproblems exist
Approach
- Identify the state variables
- Write the recurrence relation
- Choose top-down (@cache) or bottom-up (tabulation)
- Optimize space if possible
Example
"Min coins for amount" → state = remaining amount. Recurrence: dp(n) = 1 + min(dp(n - c) for c in coins). Use @cache for top-down; reduce to O(amount) space.
Related Skills
knoopx/notify
tools
VerifiedTrustedCommunity
Inform the user what is happening — skip passive lookups
52SKILL.mdUpdated May 20, 2026
knoopx/markdown-rendering
development
VerifiedTrustedCommunity
Renders markdown to self-contained HTML with a custom dark stylesheet and opens in browser. Use when previewing markdown documents, generating styled HTML from README or report files.
52SKILL.mdUpdated May 20, 2026
knoopx/jj-hunk
testing
VerifiedTrustedCommunity
Programmatic hunk selection for Jujutsu — split, commit, or squash specific hunks without interactive prompts. Use when making partial commits or selective squashes.
52SKILL.mdUpdated May 18, 2026
knoopx/jj-core
content-media
VerifiedTrustedCommunity
Manage version control with Jujutsu (jj) — no staging area, immediate changes, smart rebasing. Use when navigating history, squashing, or pushing to Git remotes.
52SKILL.mdUpdated May 18, 2026