Obsidian Notes

_List_DP

2 min read

Lecture 1 - Introduction

  1. 1. Introduction

Lecture 2 - 1D DP

  1. 1. Climbing Stairs
  2. Frog Jump
  3. Frog jump with K distances
  4. 3. House Robber
  5. 4. House Robber II

Lecture 3 - 2D DP

  1. Ninja’s Training
  2. Unique Paths
  3. Unique Paths II
  4. Minimum Path Sum
  5. Triangle
  6. Minimum Falling Path Sum
  7. Ninja and his friends check again

Lecture 4 - DP on Subsequences

  1. Subset sum equal to target
  2. Partition Equal Subset Sum
  3. 3
  4. 4
  5. 5
  6. Assign Cookies
  7. 8. Coin Change
  8. Target Sum
  9. Coin Change II
  10. 12
  11. Rod Cutting Problem

Lecture 5 - DP on Strings

  1. Longest Common Subsequence
  2. Print Longest Common Subsequence
  3. Longest Common Substring
  4. Longest Palindromic Subsequence
  5. Minimum Insertion Steps to Make a String Palindrome
  6. Delete Operation for Two Strings
  7. Shortest Common Supersequence
  8. 12
  9. Edit Distance

Lecture 6 - DP on Stocks

  1. 1. Best Time to Buy And Sell Stock
  2. Best Time to Buy and Sell Stock II
  3. Best Time to Buy and Sell Stock III
  4. Best Time to Buy and Sell Stock IV
  5. Best Time to Buy and Sell Stock with Cooldown
  6. Best Time to Buy and Sell Stock with Transaction Fee

Lecture 7 - DP on LIS

  1. 11. Longest Increasing Subsequence
  2. Print Longest Increasing Subsequence
  3. 11. Longest Increasing Subsequence - Binary search solution
  4. Largest Divisible Subset
  5. Longest String Chain
  6. Longest Bitonic Sequence
  7. Number of Longest Increasing Subsequence

Lecture 8 - MCM DP | Partition DP - Matrix Chain Multiplication