소개
The Dynamic Programming (DP) skill equips Claude with a robust framework for solving complex optimization problems through structured state definition and recurrence analysis. It provides highly optimized Python implementations for foundational patterns such as 0/1 Knapsack, Longest Common Subsequence, and Coin Change, focusing on transitioning from naive recursion to space-efficient tabulation. Whether you are optimizing resource allocation or preparing for high-level algorithmic challenges, this skill ensures your solutions meet production standards for time and space complexity.