Assess students’ ability to transform recursive solutions into dynamic programming implementations: identify overlapping subproblems and optimal substructure; choose and implement top‑down (memoization) or bottom‑up (tabulation) approaches; analyze time and space complexity; apply these techniques to 0/1 knapsack and longest common subsequence (including reconstructing the solution). Include code or clear pseudocode and note possible space optimizations (e.g., rolling arrays) and correctness reasoning.