Longest Palindromic Substring
Longest Palindromic Substring - Dynamic Programming -Given a string,find the longest substring which is palindrome. For...
Browse Tag
dynamic programming python
32 Articles
Largest Sum Contiguous Subarray
Python Programming - Largest Sum Contiguous Subarray - Dynamic Programming Write program to find the sum of contiguous...
Python Programming – Ugly Numbers
Python Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5.
Minimum number of jumps to reach end
Minimum number of jumps to reach end - Dynamic Programming An array of integers where elements represents the max number of...
C Programming – Vertex Cover Problem | Set 1 (Introduction and Approximate Algorithm)
C Programming - Vertex Cover Problem - Introduction and Approximate Algorithm - It can be proved that the above approximate...
Box Stacking Problem
Box Stacking Problem - Dynamic Programmming The Box Stacking problem is a variation of LIS problem. We need to build a...
Variations of LIS
Variations of LIS - Dynamic Programming - We have discussed Dynamic Programming solution for Longest Increasing Subsequence...
Maximum Length Chain of Pairs
Maximum Length Chain of Pairs - Dynamic Programming - The given problem is also a variation of Activity Selection problem...
C Programming – Partition Problem
C Programming - Partition Problem - Dynamic Programming Partition problem is to determine whether a given set can be...
Palindrome Partitioning
Palindrome Partitioning - Dynamic Programming a partitioning of the string is a palindrome partitioning if every substring...
