Skip to content

Saha-Kamalika/dynamic_programming

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

37 Commits
0_1_knapsack_prob.pdf
0_1_knapsack_prob.pdf
 
 
I) i) 0-1 knapsack.java
I) i) 0-1 knapsack.java
 
 
I) ii) subset sum problem.java
I) ii) subset sum problem.java
 
 
I) iii) partition equal subset sum.java
I) iii) partition equal subset sum.java
 
 
I) iv) Minimum subset sum difference.java
I) iv) Minimum subset sum difference.java
 
 
I) v) count subsets of given difference.java
I) v) count subsets of given difference.java
 
 
I) vi) Target Sum.java
I) vi) Target Sum.java
 
 
II) i) rod cutting.java
II) i) rod cutting.java
 
 
II) ii) coin change I-max no.of ways.java
II) ii) coin change I-max no.of ways.java
 
 
II) iii) coin change II_min no of coins.java
II) iii) coin change II_min no of coins.java
 
 
III) Longest Common Substring.java
III) Longest Common Substring.java
 
 
III) Longest common subsequence.java
III) Longest common subsequence.java
 
 
III) i) Printing LCS.cpp
III) i) Printing LCS.cpp
 
 
III) ii) Min total deletions to covert two strings to same.cpp
III) ii) Min total deletions to covert two strings to same.cpp
 
 
III) iii) Length of shortest common supersequence.cpp
III) iii) Length of shortest common supersequence.cpp
 
 
III) iv) Longest Palindromic Subsequence.cpp
III) iv) Longest Palindromic Subsequence.cpp
 
 
III) v) Print SCS.cpp
III) v) Print SCS.cpp
 
 
III) vi) Longest Repeating Subsequence.cpp
III) vi) Longest Repeating Subsequence.cpp
 
 
III) vii) Min number of insertion to make a string palindrome.cpp
III) vii) Min number of insertion to make a string palindrome.cpp
 
 
IV) i) Matrix Chain Multiplication (memoizised).cpp
IV) i) Matrix Chain Multiplication (memoizised).cpp
 
 
IV) ii) Palindromic Partitioning.cpp
IV) ii) Palindromic Partitioning.cpp
 
 
IV) iii)Evaluate expression to true.cpp
IV) iii)Evaluate expression to true.cpp
 
 
IV) iv) Scrambled String.cpp
IV) iv) Scrambled String.cpp
 
 
IV) v) Egg Dropping.cpp
IV) v) Egg Dropping.cpp
 
 
README.md
README.md
 
 
V) i)Diameter of BT.cpp
V) i)Diameter of BT.cpp
 
 
V) ii) Maximum Path Sum from any node.cpp
V) ii) Maximum Path Sum from any node.cpp
 
 
coin_change_prob1.pdf
coin_change_prob1.pdf
 
 
coin_change_prob2.pdf
coin_change_prob2.pdf
 
 
fractional_knapsack_prob.pdf
fractional_knapsack_prob.pdf
 
 
longest_common_subsequence.pdf
longest_common_subsequence.pdf
 
 
subset_sum_prob.pdf
subset_sum_prob.pdf
 
 
travelling_salesman_prob.pdf
travelling_salesman_prob.pdf
 
 

Repository files navigation

dynamic_programming

this repo includes the DP approach of solving problems

About

this repo includes the DP approach of solving problems

Topics

dynamic-programming

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages