Dynamic Programming

  1. String Dynamic Programming
    1. String Comparison and Manipulation
      1. Character-by-Character Analysis
        1. Subsequence vs Substring Distinctions
        2. Classic String DP Problems
          1. Longest Common Subsequence
            1. Two String LCS
              1. Multiple String LCS
                1. LCS Reconstruction
                2. Longest Common Substring
                  1. Contiguous Character Matching
                    1. Multiple String Extensions
                    2. Edit Distance
                      1. Levenshtein Distance
                        1. Operation Cost Variations
                          1. Edit Sequence Reconstruction
                          2. Palindrome Problems
                            1. Longest Palindromic Subsequence
                              1. Longest Palindromic Substring
                                1. Palindrome Partitioning
                                2. String Matching and Patterns
                                  1. Wildcard Pattern Matching
                                    1. Regular Expression Matching
                                      1. Interleaving Strings

                                  Previous

                                  6. Grid-Based Dynamic Programming

                                  Go to top

                                  Next

                                  8. Knapsack Problem Variants