GitHub - amarendra234/Dynamic-Programing-Pattern: In this Repo I am to solve dynamic Programing question Via pattern wise

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 49 Commits
Arithmetic Slices-1		Arithmetic Slices-1
Build Array Where You Can Find The Maximum Exactly K Comparisons		Build Array Where You Can Find The Maximum Exactly K Comparisons
Climbing Stairs		Climbing Stairs
Count Number of Ways to Place Houses		Count Number of Ways to Place Houses
Count subsequences of type a^i, b^j, c^k		Count subsequences of type a^i, b^j, c^k
Decode Ways		Decode Ways
Decode Ways(Iterative)		Decode Ways(Iterative)
Dungeon Game		Dungeon Game
Edit Distance		Edit Distance
Geeks Training		Geeks Training
Gold Mine Problem		Gold Mine Problem
Gold Mine Problem(Iterative)		Gold Mine Problem(Iterative)
Knapspack		Knapspack
Knapspack with duplicate itme		Knapspack with duplicate itme
Longest Increasing Subsequences		Longest Increasing Subsequences
Longest Repeating Subsequence		Longest Repeating Subsequence
Longest String chain		Longest String chain
Longest commone subsequence		Longest commone subsequence
Max Sum without Adjacents		Max Sum without Adjacents
Maximize cut size		Maximize cut size
Maximum Alternating Subsequence sum		Maximum Alternating Subsequence sum
Maximum Length of Pair chain		Maximum Length of Pair chain
Maximum profit in job scheduling		Maximum profit in job scheduling
Min or max falling path sum		Min or max falling path sum
Minimum Cost For Tickets		Minimum Cost For Tickets
Minimum Number of coin to make change		Minimum Number of coin to make change
Minimum Path Sum		Minimum Path Sum
Minimum number of coin		Minimum number of coin
Minimum sum Partition		Minimum sum Partition
Partition Equal Subset Sum		Partition Equal Subset Sum
Path with Maximum Gold		Path with Maximum Gold
Perfect Squares		Perfect Squares
Regular Expression Matching		Regular Expression Matching
Rod cutting Problem		Rod cutting Problem
Solving questions with brainpower		Solving questions with brainpower
Subset Sum problem		Subset Sum problem
Total number of way to make coin		Total number of way to make coin
Triangle		Triangle
Uncrossed Line		Uncrossed Line
Unique Path		Unique Path
Unique path 2		Unique path 2
maximum length of a concatenated string with unique characters		maximum length of a concatenated string with unique characters
target sum to k		target sum to k
target sum with difference k		target sum with difference k