Dynamic Problem


————————————–LCS———————————
111 – History Grading
Solution: MyCode
UVA: 10066 – The Twin Towers(LCS_PROBLEM)
Solution:Click here
UVA: 10405 – Longest Common Subsequence(LCS_PROBLEM)
Solution: Click here
Uva 10192 – Vacation(LCS_PROBLEM)
Solution: Click here
12484 – Cards
Solution: Click here
10723 – Cyborg Genes
Solution: MyCode

—————————Longest increasing subsequence————————–
Solution : MyCode

—————–Coin_Change_Related————————–
10313 – Pay the Price
Solution: MyCode
11137 – Ingenuous Cubrency
Solution: MyCode
674 – Coin Change
Solution: MyCode :: help

………………………….Basic_Implementation……………………………
10446 – The Marriage Interview 🙂
Solution: MyCode

——————————–Combination———————————-
Problem: NCR
Solution: MyCode
369 – Combinations(dp solution)
Solution: MyCode

——————————–0-1 knapsack problem———————–
10130 – SuperSale
Solution: MyCode
10616 – Divisible Group Sums
Solution: MyCode
10664 – Luggage
Solution: MyCode
562 – Dividing coins
Solution: MyCode

————————————–Palindrome————————————
10739 – String to Palindrome
Solution: MyCode
11151 – Longest Palindrome
Solution: MyCode

One thought on “Dynamic Problem

  1. Pingback: Home: | programming

Leave a comment