dynamic-programming

The Dynamic Programming (DP) skill is a highly specialized engineering module designed for developers, students, and competitive programmers aiming to master complex optimization problems. It provides a robust framework for breaking down recursive problems into efficient, iterative solutions. By focusing on the core DP lifecycle—state definition, recurrence relations, base cases, evaluation order, and space optimization—this skill enables users to transform brute-force exponential-time algorithms into O(n) or O(n*W) complexity solutions. It is particularly effective for technical interview preparation, algorithm optimization in production pipelines, and building scalable software components that require efficient resource management. Users can leverage this skill to handle standard DP archetypes including Fibonacci variations, 0/1 Knapsack, Longest Common Subsequence (LCS), Coin Change, and Longest Increasing Subsequence (LIS).

• Provides comprehensive implementations for top-down memoization using functools.lru_cache and bottom-up tabulation strategies.

• Includes advanced space-optimization techniques to reduce memory footprints from O(n) to O(1) where applicable.

• Offers modularized patterns for knapsack problems, sequence alignment, and combinatorial optimization, ensuring code reusability.

• Features strict parameter validation and robust error handling for recursion depth and memory limitations.

• Supports SASMP v1.3.0 compliance for seamless integration within the Data Structures Algorithms Assistant agent framework.

• Expects input sequences (lists), target integer values, and optional memoization dictionaries for flexible function invocation.

• Best utilized when solving problems characterized by overlapping subproblems and optimal substructure properties.

• Users should ensure hardware constraints are evaluated for large-scale recursive calls, opting for iterative tabulation when stack depth becomes a bottleneck.

• Integrates directly with Claude Code via slash commands to generate boilerplate and optimize existing algorithmic code blocks.