Skip to content

Atharva-Morankar-09/Dynamic_Programming

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

74 Commits
1.0)CountWaystoReach_Nth_Step
1.0)CountWaystoReach_Nth_Step
 
 
1.1)0-1_KnapSack
1.1)0-1_KnapSack
 
 
1.1.1)Unbounded_Knapsack
1.1.1)Unbounded_Knapsack
 
 
1.1.2)Coin_Change
1.1.2)Coin_Change
 
 
1.1.3)Coin_Change_Min
1.1.3)Coin_Change_Min
 
 
1.1.4)Minimum Cost For Tickets
1.1.4)Minimum Cost For Tickets
 
 
1.1.5)Reducing Dishes
1.1.5)Reducing Dishes
 
 
1.1.6)Predict the Winner
1.1.6)Predict the Winner
 
 
1.2)Frog_Jump
1.2)Frog_Jump
 
 
1.3)MaxSumof_Non-Adjacent
1.3)MaxSumof_Non-Adjacent
 
 
1.4.1)House_Robber
1.4.1)House_Robber
 
 
1.4.2)House_Robber_2
1.4.2)House_Robber_2
 
 
1.5)Subset_Sum
1.5)Subset_Sum
 
 
1.6)Partition_Equal_Subset_Sum
1.6)Partition_Equal_Subset_Sum
 
 
1.7)Ninjas_Training
1.7)Ninjas_Training
 
 
1.8)Min_Subset_Diff
1.8)Min_Subset_Diff
 
 
1.9)Count_Subset_with_Given_Diff
1.9)Count_Subset_with_Given_Diff
 
 
2.0)Target_Sum
2.0)Target_Sum
 
 
2.1)Unique_Paths
2.1)Unique_Paths
 
 
2.2)Unique_Paths_II
2.2)Unique_Paths_II
 
 
2.3)Min_Path_Sum
2.3)Min_Path_Sum
 
 
2.4)Triangle
2.4)Triangle
 
 
2.4.1)Walls Coloring
2.4.1)Walls Coloring
 
 
2.5)Max_Path_Sum_Matrix
2.5)Max_Path_Sum_Matrix
 
 
2.6)3D_Grid
2.6)3D_Grid
 
 
2.6.1)Shortest XY distance in Grid
2.6.1)Shortest XY distance in Grid
 
 
2.7)LCS
2.7)LCS
 
 
2.8)LCSubstring
2.8)LCSubstring
 
 
2.9)Shortest_Common_Supersequence
2.9)Shortest_Common_Supersequence
 
 
3.0)Minimum number of deletions and insertions
3.0)Minimum number of deletions and insertions
 
 
3.1)Longest Palindromic Subsequence
3.1)Longest Palindromic Subsequence
 
 
3.2)Minimum deletions Palindrome
3.2)Minimum deletions Palindrome
 
 
3.3)Longest Repeating Subsequence
3.3)Longest Repeating Subsequence
 
 
3.4)Sequence_Pattern_Matching
3.4)Sequence_Pattern_Matching
 
 
3.5)Longest Increasing Subsequence
3.5)Longest Increasing Subsequence
 
 
3.6)Minimum Insertion Steps to Make a String Palindrome
3.6)Minimum Insertion Steps to Make a String Palindrome
 
 
3.7)Minimum ASCII Delete Sum for Two Strings
3.7)Minimum ASCII Delete Sum for Two Strings
 
 
4.0)Matrix Chain Multiplication
4.0)Matrix Chain Multiplication
 
 
4.1)Palindromic Partitioning
4.1)Palindromic Partitioning
 
 
4.2)Boolean Parenthesization
4.2)Boolean Parenthesization
 
 
4.3)Scramble String
4.3)Scramble String
 
 
4.4)Egg Dropping Puzzle
4.4)Egg Dropping Puzzle
 
 
4.5)Burst Balloons
4.5)Burst Balloons
 
 
4.6)Divide in Incremental Groups
4.6)Divide in Incremental Groups
 
 
4.7)Number of Ways of Cutting a Pizza
4.7)Number of Ways of Cutting a Pizza
 
 
5.0)Diameter of Binary Tree
5.0)Diameter of Binary Tree
 
 
5.1)Domino and Tromino Tiling
5.1)Domino and Tromino Tiling
 
 
5.2)Word Break
5.2)Word Break
 
 
README.md
README.md
 
 

Repository files navigation

Dynamic Programming

Dynamic Programming is a technique in computer programming that helps to efficiently solve a class of problems that have overlapping subproblems and optimal substructure property.

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors