Dynamic Programming

  1. Linear Dynamic Programming
    1. One-Dimensional State Problems
      1. Single Parameter Dependencies
        1. Sequential Decision Making
        2. Classic Linear DP Problems
          1. Fibonacci Sequence
            1. Naive Recursive Solution
              1. Memoized Solution
                1. Tabulated Solution
                  1. Space-Optimized Solution
                  2. Climbing Stairs
                    1. Basic Stair Climbing
                      1. Variable Step Sizes
                        1. Cost-Based Variations
                        2. House Robber
                          1. Linear Array Robbing
                            1. Circular Array Robbing
                              1. Binary Tree Robbing
                              2. Maximum Subarray Sum
                                1. Kadane's Algorithm
                                  1. DP Interpretation
                                  2. Coin Change Problems
                                    1. Minimum Coins Problem
                                      1. Number of Ways Problem
                                        1. Coin Combinations vs Permutations
                                        2. Longest Increasing Subsequence
                                          1. O(n²) DP Solution
                                            1. O(n log n) Binary Search Solution
                                              1. Patience Sorting Interpretation

                                          Previous

                                          4. Problem-Solving Framework

                                          Go to top

                                          Next

                                          6. Grid-Based Dynamic Programming