Dynamic Programming

In this section we will see problems based on Dynamic Programming, such as Longest Common Subsequence Problem, The Levenshtein distance (Edit distance) Problem, Matrix Chain, Multiplication Problem, 0–1 Knapsack Problem, Partition Problem & Rod Cutting Problem.
Find minimum number of jumps to reach the end

Posted on Mar 31, 2024

Find length of Longest Palindrome Substring (Recursion & DP)

Posted on Mar 31, 2024

Gold Mine Problem (Recursion & Dynamic Programming)

Posted on Mar 31, 2024

Print Longest Palindrome in a String (Dynamic Programming)

Posted on Mar 31, 2024

Count Palindromic Subsequence (Recursion & DP)

Posted on Mar 31, 2024

Buy and sell stocks to maximise profit (Unlimited transactions)

Posted on Mar 31, 2024

Binomial Coefficient problem (Dynamic Programming & Recursion)

Posted on Mar 31, 2024

Word Wrap Problem (Dynamic Programming & Recursion)

Posted on Mar 31, 2024