dynamic-programming

Finding the contiguous subarray with the largest product using dynamic programming tracking both min and max in Python

Computing the longest common subsequence of two strings with a 2D dynamic programming table in Python

An O(n²) Python DP solution that tracks the longest increasing subsequence ending at each index

A Python dynamic programming solution for checking whether a string can be segmented by a word dictionary

A Python DFS and memoization solution that stores the minimum coin count for each remaining amount

A Python recursion and memoization solution that counts valid one-digit and two-digit decodings

A Python solution using Kadane's algorithm to find the maximum sum of a contiguous subarray

A recursion and memoization write-up for the Climbing Stairs problem.