Skip to content

Dynamic Programming

Jump to bottom
Arighna Chakrabarty edited this page Aug 1, 2018 · 5 revisions

These are some of the most important questions of DP :--

  1. Longest Palindromic Substring - DP solution

  2. Longest Palindromic Substring - Constant Space Solution

  3. Manacher's Algorithm - Linear Time Longest Palindromic Substring

  4. Longest Palindromic Subsequence

  5. Print Longest Palindromic Subsequence

  6. Subset Sum - O(sum*n) solution

  7. Subset Sum - O(sum) space solution

  8. 0-1 Knapsack Problem

  9. Unbounded Knapsack - Any number of items can be taken

  10. Longest Common Subsequence

  11. Printing Longest Common Subsequence

  12. Space Optimized solution of LCS

  13. Longest Increasing Subsequence

  14. Printing LIS

  15. Maximum Sum Increasing Subsequence

  16. Longest Decreasing Subsequence - A variation of LIS

  17. Longest Bitonic Subsequence

  18. Longest Repeated Subsequence

  19. Interleaved String

  20. Coin change

  21. Edit Distance

  22. Min Cost Path

  23. [Rod cutting](

  24. Minimum Partition

  25. Partition Problem

  26. No. of ways to cover a distance

  27. Egg Dropping Puzzle

  28. Maximum size rectangle with all 1s

Clone this wiki locally