Tri's external memory

Home

❯

02 - Programming and Algorithms

❯

Programming

❯

Dynamic Programming

Dynamic Programming

1 min read

Lesson 1-3 Notes

Lesson 4 Coin Change (Minimum Coins)

Lesson 5 Longest Common Subsequence (LCS)

Lesson 6 Edit Distance

Lesson 7 Maximum Subarray (Kadane’s Algorithm)

Lesson 8 Longest Increasing Subsequence (LIS)

Dynamic Programming Lesson 9 Interval DP (Matrix Chain Multiplication)


Graph View

  • Lesson 1-3 Notes
  • Lesson 4 Coin Change (Minimum Coins)
  • Lesson 5 Longest Common Subsequence (LCS)
  • Lesson 6 Edit Distance
  • Lesson 7 Maximum Subarray (Kadane’s Algorithm)
  • Lesson 8 Longest Increasing Subsequence (LIS)
  • Dynamic Programming Lesson 9 Interval DP (Matrix Chain Multiplication)

Backlinks

  • Computer Science Term
  • 02 - Programming and Algorithms
  • Tech Book

Created with Quartz v5.0.0 © 2026

  • GitHub
  • Discord Community