Scribd
Upload
45 views

Dynamic Programming

The document lists various dynamic programming problems including: finding the longest common subsequence, longest increasing subsequence, shortest common supersequence, Levenshtein distance, 0-1 knapsack problem, coin change problem, word break problem, and single-source shortest paths. It covers classic problems involving strings, sequences, matrices, graphs, and optimization.

Uploaded by

Pop David
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
45 views

Dynamic Programming

The document lists various dynamic programming problems including: finding the longest common subsequence, longest increasing subsequence, shortest common supersequence, Levenshtein distance, 0-1 knapsack problem, coin change problem, word break problem, and single-source shortest paths. It covers classic problems involving strings, sequences, matrices, graphs, and optimization.

Uploaded by

Pop David
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

Longest Common Subsequence | Introduction & LCS Length X

Longest Common Subsequence | Finding all LCS X


Longest Common Substring problem X
Longest Palindromic Subsequence using Dynamic Programming
Longest Repeated Subsequence Problem
Implement Diff Utility X
Shortest Common Supersequence | Introduction & SCS Length
Shortest Common Supersequence | Finding all SCS
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 using Dynamic Programming
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 the Value of an Expression
Partition problem | Dynamic Programming Solution
Subset Sum Problem
Minimum Sum Partition Problem
Find all N-digit binary strings without any consecutive 1’s
Rod Cutting Problem
Maximum Product Rod Cutting
Coin change-making problem (unlimited supply of coins)
Coin Change Problem (Total number of ways to get the denomination of coins)
Longest Alternating Subsequence Problem
Count number of times a pattern appears in given string as a subsequence
Collect maximum points in a matrix by satisfying given constraints
Count total possible combinations of N-digit numbers in a mobile keypad
Find Optimal Cost to Construct Binary Search Tree
Word Break Problem | Dynamic Programming
Word Break Problem | Using Trie Data Structure
Total possible solutions to linear equation of k variables
Wildcard Pattern Matching
Find Probability that a Person is Alive after Taking N steps on an Island
Calculate sum of all elements in a sub-matrix in constant time
Find Maximum Sum Submatrix in a given matrix
Find Maximum Sum Submatrix present in a given matrix
Find maximum sum of subsequence with no adjacent elements
Maximum Subarray Problem (Kadane’s algorithm)
Single-Source Shortest Paths — Bellman Ford Algorithm
All-Pairs Shortest Paths — Floyd Warshall Algorithm
Pots of Gold Game using Dynamic Programming
Find minimum cuts needed for palindromic partition of a string
Maximum Length Snake Sequence
3-Partition Problem
Calculate size of the largest plus of 1’s in binary matrix
Check if given string is interleaving of two other given strings

You might also like