Sorting Theory

Problems

Introduction to DP First n Fibonacci Nth Catalan Number Coin Change (Minimum Coins) Coin Change (Count Ways) Ways to write n as sum Count ways to N'th Stair Count ways to N'th Stair(Order does not matter) Count number of hops Reach a given score Minimum Jumps nCr Kadane's Algorithm Unique BST's Sum of all substrings of a number Max sum subarray by removing at most one element Longest Increasing Subsequence Longest Common Subsequence Shortest Common Supersequence Number of Unique Paths Maximize The Cut Segments Subset Sum Problem 0 - 1 Knapsack Problem Optimal Strategy For A Game Egg Dropping Puzzle Stickler Thief