Dynamic Programming

• Climbing Stairs

  Climbing Stairs — ways to climb n stairs taking 1 or 2 steps

• Coin Change

  Coin Change — minimum coins to make amount

• Constraint Satisfaction

  Constraint Satisfaction Problem — generic CSP solver with Sudoku example

• Edit Distance

  Edit Distance — minimum operations to convert word1 to word2

• Knapsack

  0/1 Knapsack — maximize value within weight capacity

• Longest Common Subseq

  Longest Common Subsequence — length of LCS of two strings

• Longest Increasing Subseq

  Longest Increasing Subsequence — length of LIS

• Traveling Salesman DP

  Traveling Salesman Problem — bitmask DP solution