Learning Data Structures and Algorithms

• 01 Knapsack
• Subset Sum
• AtCoder - Frog 1

• Equal Sum Partition
• Count Of Subset With Given Sum
• AtCoder - Frog 2

• Minimum Sum Subset Difference
• Count Of Subset With Given Difference
• AtCoder - Vacation

• Target Sum
• Unbounded Knapsack
• Rod Cutting

• Coin Change - Number Of Ways To Make Amount
• Coin Change - Minimum Number Of Coins To Make Amount

• Longest Common Subsequence
• Longest Common Substring

• Print Longest Common Subsequence
• Shortest Common Super Sequence
• Minimum Number Of Insertion And Deletion(Convert String A To B)

• Longest Palindromic Subsequence
• Minimum Deletion To Make String Palindrome
• Print SCS(Shortest Common SuperSequence)

• Longest Repeating Subsequence
• Sequence Pattern Matching
• Minimum Insertion To Make String Palindrome

• Matrix Chain Multiplication

• Palindrome Partitioning

• Number Of Ways To Evaluate Expression To True

• OctoberDusk ACM Contest
• AtCoder Begineer Contest 180

• KickStart Round G

• Scrambled String

• Codeforces Round 677(Div 3)
• Egg Dropping Problem

• Multi Knapsack

• Diameter Of Binary Tree

• Maximum Path Sum Between Any Two Nodes

• Maximum Path Sum Between Two Leaf Nodes

• Sum Tree(Root Value Equal to its child)
• Diagonal Tree Traversal