Scribd
Upload
24 views1 page

Dynamic Programming (Beginner Level)

This document provides an introduction to dynamic programming and lists various dynamic programming problems including longest common subsequence, longest common substring, longest palindromic subsequence, longest repeated subsequence, shortest common supersequence, longest increasing subsequence, Levenshtein distance, matrix chain multiplication, 0-1 knapsack problem, and partitioning problems. It outlines algorithms for finding lengths, sequences, and values for each of these classic dynamic programming challenges.

Uploaded by

nimisha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views1 page

Dynamic Programming (Beginner Level)

This document provides an introduction to dynamic programming and lists various dynamic programming problems including longest common subsequence, longest common substring, longest palindromic subsequence, longest repeated subsequence, shortest common supersequence, longest increasing subsequence, Levenshtein distance, matrix chain multiplication, 0-1 knapsack problem, and partitioning problems. It outlines algorithms for finding lengths, sequences, and values for each of these classic dynamic programming challenges.

Uploaded by

nimisha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Dynamic

Programming(beginner Level):

Introduction to Dynamic Programming
Longest Common Subsequence | Introduction & LCS Length
Longest Common Subsequence | Space optimized version
Longest Common Subsequence of K-sequences
Longest Common Subsequence | Finding all LCS
Longest Common Substring problem
Longest Palindromic Subsequence using Dynamic Programming
Longest Repeated Subsequence problem
Implement Diff Utility
Shortest Common Supersequence | Introduction & SCS Length
Shortest Common Supersequence | Finding all SCS
Shortest Common Supersequence | Using LCS
Longest Increasing Subsequence using Dynamic Programming
Longest Bitonic Subsequence
Increasing Subsequence with Maximum Sum
The Levenshtein distance (Edit distance) problem
Find size of largest square sub-matrix of 1’s present in given binary matrix
Matrix Chain Multiplication
Find the minimum cost to reach last cell of the matrix from its first cell
Find longest sequence formed by adjacent numbers in the matrix
Count number of paths in a matrix with given cost to reach destination cell
0-1 Knapsack problem
Maximize value of the expression
Partition problem

You might also like