## Longest Palindromic Substring

Longest Palindromic Substring – Dynamic Programming -Given a string,find the longest substring which is palindrome. For example, if the given string ing is

Longest Palindromic Substring – Dynamic Programming -Given a string,find the longest substring which is palindrome. For example, if the given string ing is

Python Programming – Largest Sum Contiguous Subarray – Dynamic Programming Write program to find the sum of contiguous subarray within one-dimensional array

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 – Dynamic Programming An array of integers where elements represents the max number of steps that can be made forward

C Programming – Vertex Cover Problem – Introduction and Approximate Algorithm – It can be proved that the above approximate algorithm never finds a vertex

Box Stacking Problem – Dynamic Programmming The Box Stacking problem is a variation of LIS problem. We need to build a maximum height stack.

Variations of LIS – Dynamic Programming – We have discussed Dynamic Programming solution for Longest Increasing Subsequence problem in this post

Maximum Length Chain of Pairs – Dynamic Programming – The given problem is also a variation of Activity Selection problem and can be solved in (nLogn) time.

C Programming – Partition Problem – Dynamic Programming Partition problem is to determine whether a given set can be partitioned into two subsets

Palindrome Partitioning – Dynamic Programming a partitioning of the string is a palindrome partitioning if every substring of the partition is a palindrome.