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
Unbounded Knapsack
Longest Common Subsequence (LCS)
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.

Name		Name	Last commit message	Last commit date
Latest commit History 21 Commits
LCS_bottom_up_dp.cpp		LCS_bottom_up_dp.cpp
LCS_memoization.cpp		LCS_memoization.cpp
LCS_recursive.cpp		LCS_recursive.cpp
LCSubstring.cpp		LCSubstring.cpp
MCM_memoization.cpp		MCM_memoization.cpp
MCM_recursive.cpp		MCM_recursive.cpp
README.md		README.md
SCS.cpp		SCS.cpp
coin_change_max_ways.cpp		coin_change_max_ways.cpp
coin_change_min_coins.cpp		coin_change_min_coins.cpp
count_of_subset_with_given_diff.cpp		count_of_subset_with_given_diff.cpp
count_of_subsets_with_given_sum.cpp		count_of_subsets_with_given_sum.cpp
diameter_of_binary_tree.cpp		diameter_of_binary_tree.cpp
egg_dropping_problem_memoization.cpp		egg_dropping_problem_memoization.cpp
egg_dropping_problem_memoized_optimization.cpp		egg_dropping_problem_memoized_optimization.cpp
egg_dropping_problem_optimized_for_leetcode.cpp		egg_dropping_problem_optimized_for_leetcode.cpp
egg_dropping_problem_recursive.cpp		egg_dropping_problem_recursive.cpp
equal_sum_partition_problem.cpp		equal_sum_partition_problem.cpp
evaluate_expression_to_true.cpp		evaluate_expression_to_true.cpp
evaluate_expression_to_true_bottom_up_dp_using_3d_array.cpp		evaluate_expression_to_true_bottom_up_dp_using_3d_array.cpp
evaluate_expression_to_true_memoization_using_3d_array.cpp		evaluate_expression_to_true_memoization_using_3d_array.cpp
evaluate_expression_to_true_memoization_using_map.cpp		evaluate_expression_to_true_memoization_using_map.cpp
knapsack_memoization.cpp		knapsack_memoization.cpp
knapsack_recursive.cpp		knapsack_recursive.cpp
knapsack_top_down_dp.cpp		knapsack_top_down_dp.cpp
longest_pallin_subseq.cpp		longest_pallin_subseq.cpp
longest_repeating_subseq.cpp		longest_repeating_subseq.cpp
max_path_sum_from_any_node_to_any.cpp		max_path_sum_from_any_node_to_any.cpp
max_path_sum_from_leaf_to_leaf.cpp		max_path_sum_from_leaf_to_leaf.cpp
min_del_to_make_pallindrome.cpp		min_del_to_make_pallindrome.cpp
min_insertion_del__to_convert_a_to_b.cpp		min_insertion_del__to_convert_a_to_b.cpp
min_insertion_to_make_string_pallindrome.cpp		min_insertion_to_make_string_pallindrome.cpp
min_subset_sum_diff.cpp		min_subset_sum_diff.cpp
pallindrome_partitioning_memoization.cpp		pallindrome_partitioning_memoization.cpp
pallindrome_partitioning_memoized_optimization.cpp		pallindrome_partitioning_memoized_optimization.cpp
pallindrome_partitioning_recursive.cpp		pallindrome_partitioning_recursive.cpp
print_LCS.cpp		print_LCS.cpp
print_SCS.cpp		print_SCS.cpp
rod_cutting_problem.cpp		rod_cutting_problem.cpp
scramble_strings.cpp		scramble_strings.cpp
scramble_strings_memoization.cpp		scramble_strings_memoization.cpp
sequence_patttern_matching.cpp		sequence_patttern_matching.cpp
subset_sum_problem_dp.cpp		subset_sum_problem_dp.cpp
target_sum.cpp		target_sum.cpp

osshu320/Dynamic-Programming-Questions-by-Aditya-Verma

Folders and files

Latest commit

History

Repository files navigation

Dynamic-Programming-Questions-by-Aditya-Verma

About

Topics

Resources

Stars

Watchers

Forks

Languages