Dynamic Programming

In this section you can find several DP solutions to the classical problems. And some non-classical DPs as well.

Contents:

• Coin Change
  • Standard
  • Cache Friendly
  • Ways
• Knapsack
  • Binary
• Longest Increasing Subsequence (LIS)
  • Quadratic Solution
  • N log N Solution
• Max Range Sum
  • 1D Range Sum
  • 1D Range Sum (kadane)
  • 2D Range Sum
• Travellers Salesman Problem (TSP)