Learning Resources

This generated surface maps a learner-facing curriculum unit to its canonical source routes.

Curriculum surface

• Open learner-facing unit
• Curriculum path: content/curriculum/foundations/semester-02-algorithms/module-04-dynamic-programming/resources.md
• App: foundations
• Semester: semester-02-algorithms
• Module: module-04-dynamic-programming
• Unit kind: resource
• Curation level: generated_default

Learning objectives

• Pick a high-value support resource for Learning Resources without replacing the learner-facing module sequence.
• State why the chosen source belongs in the current learning problem before spending time on it.
• Return from the external resource with a concrete next action in the module.

Prerequisites

• The earlier concept pages and practice tasks in the current module.

Source books

• competitive-programming
• grokking-algorithms
• introduction-to-algorithms-clrs
• the-algorithm-design-manual

Source routes

Competitive Programming

• /books/competitive-programming via Competitive Programming: 3.5 Dynamic Programming, Competitive Programming: 3.5.2 Classical Examples (Coin Change), Competitive Programming: 3.5.2 Classical Examples (Counting Paths), Competitive Programming: 3.5.2 Classical Examples (Knapsack), Competitive Programming: 3.5.2 Classical Examples (LIS), Competitive Programming: 3.5.3 Non-classical Examples, Competitive Programming: 6.5 String Processing With DP, Competitive Programming: 8.3 More Advanced DP Techniques, Competitive Programming: 8.3.2 Common DP Parameters, Competitive Programming: 8.3.4 MLE: Balanced BST as Memo Table, Competitive Programming: 9.22 Max Weighted Independent Set, Competitive Programming: 9.24 Min Path Cover on DAG

Grokking Algorithms

• /books/grokking-algorithms/chapter-08-greedy-algorithms via Grokking Algorithms: 8 Greedy Algorithms
• /books/grokking-algorithms/chapter-09-dynamic-programming-part-1 via Grokking Algorithms: 9 DP (Part 1), Grokking Algorithms: 9 DP (Part 2)

Introduction To Algorithms Clrs

• /books/introduction-to-algorithms-clrs/chapter-14-rod-cutting via CLRS 14.1 Rod cutting (Part 1), CLRS 14.1 Rod cutting (Part 3), CLRS 14.2 Matrix Chain (Part 1), CLRS 14.2 Matrix Chain (Part 2), CLRS 14.3 Elements of DP (Part 1), CLRS 14.3 Elements of DP (Part 2), CLRS 14.3 Elements of DP (Part 3), CLRS 14.4 LCS (Part 1), CLRS 14.5 Optimal BST (Part 1)
• /books/introduction-to-algorithms-clrs/chapter-15-an-activity-selection-problem via CLRS 15.1 Activity Selection (Part 1), CLRS 15.2 Elements of the Greedy Strategy (Part 1), CLRS 15.2 Elements of the Greedy Strategy (Part 2)

The Algorithm Design Manual

• /books/the-algorithm-design-manual/chapter-08-fibonacci-numbers-by-recursion via Skiena 8.1.2 Fibonacci by Caching, Skiena 8.2.2 Edit Distance by DP, Skiena 8.2.3 Reconstructing the Path, Skiena 8.2.4 Varieties of Edit Distance, Skiena 8.3 Longest Increasing Sequence, Skiena 8.5 The Partition Problem, Skiena 8.6.1 Min Weight Triangulation, Skiena 8.7 Limitations of DP (TSP)
• /books/the-algorithm-design-manual/chapter-10-how-to-design-algorithms via Skiena 10 How to Design Algorithms
• /books/the-algorithm-design-manual/chapter-13-numerical-problems via Skiena 13.10 Knapsack Problem

Supporting curriculum routes

No supporting curriculum routes linked yet.

External enrichment

No curated enrichment resources yet.

AI companion modes

• Explain simply
• Socratic tutor
• Quiz me
• Challenge my understanding
• Diagnose my confusion
• Generate extra practice
• Revision mode
• Connect forward / backward

Source-of-truth note

This teaching unit is learner-facing guidance assembled from multiple canonical book routes. Use the listed source books as the primary conceptual spine for Learning Resources, and treat outside material as supporting enrichment only.