Dynamic-Programming-Questions-by-Aditya-Verma

Codes of all questions covered by Aditya Verma in his Dynamic Programming Lectures
(Codes are tested on gfg / leetcode and are in the order of videos)
Note: Click on title of question to go to the page of code

• 0/1 Knapsack
  • Knapsack Recursive
    • Video Link
  • Knapsack Memoization
    • Video Link
  • Knapsack Bottom-up
    • Video Link
  • Subset Sum Problem
    • Video Link
  • Equal Sum Partition Problem
    • Video Link
  • Count of Subsets Sum with a Given Sum
    • Video Link
  • Min Subset Sum Difference
    • Video Link
  • Count of Subsets with given diff
    • Video Link
  • Target Sum - Specific to leetcode problem
    • Video Link
• Unbounded Knapsack
  • Rod Cutting Problem
    • Video Link
  • Coin Change - I: max number of ways
    • Video Link
  • Coin Change - II: min number of coins
    • Video Link
• Longest Common Subsequence (LCS)
  • LCS Recursive
    • Video Link
  • LCS Memoization
    • Video Link
  • LCS Bottom - Up DP
    • Video Link
  • Longest Common Substring
    • Video Link
  • Print LCS
    • Video Link
  • Shortest Common Supersequence (SCS)
    • Video Link
  • Min # of insertion and deletion to convert a to b
    • Video Link
  • Longest Pallindromic Subsquence (LPS)
    • Video Link
  • Min Number of deletions in string to make it pallindrome
    • Video Link
  • Print SCS
    • Video Link
  • Longest Repeating Subsequence
    • Video Link
  • Sequence Pattern Matching
    • Video Link
  • Min number of insertion in a string to make string pallindrome
    • Video Link
• Matrix Chain Multiplication (MCM)
  • MCM Recursive
    • Video Link
  • MCM Memoization
    • Video Link
  • Pallindrome Partitioning Recursive
    • Video Link
  • Pallindrome Partitioning Memoization
    • Video Link
  • Pallindrome Partitioning Optimization -> Still Giving TLE on GFG(Will Update if found better)
    • Video Link
    • To Solve these problem on GFG Click Here.
  • Evaluate Expression to true Recursive
    • Video Link
  • Evaluate Expression to true Memoization: Using Map -> Giving TLE on GFG (Will Update if found better)
    • Video Link
    • To Solve these problem on GFG Click Here.
  • Evaluate Expression to true Memoization: Using 3d Array
    • Video Link
  • Scramble String Recursive
    • Video Link
  • Scramble String Memoization
    • Video Link
    • To Solve these problem on leetcode Click Here.
  • Egg Dropping Problem Recursive
    • Video Link
  • Egg Dropping Problem Memoization
    • Video Link
  • Egg Dropping Problem Memoization Optimization - As suggested in lectures
    • Video Link
    • To Solve these problem on GFG Click Here.
  • Egg Dropping Problem Optimization Using Concept of Binary Search - Accepted on Leetcode (Credits: Comment below video)
    • To Solve these problem on leetcode Click Here.
• DP on Trees (Direct Solutions to leetcode / gfg problems)
  • Diameter of Binary Tree
    • Video Link
    • To Solve these problem on leetcode Click Here.
  • Maximum path sum (from any node to any node)
    • Video Link
    • To Solve these problem on leetcode Click Here.
  • Maximum path sum from leaf to leaf
    • Video Link
    • To Solve these problem on GFG Click Here.