Leetcode Problems01-12-2026Dynamic Programming Longest Increasing Subsequence Integer Break String DP Edit Distance Regular Expression Matching Strange Printer Knapsack Pattern overview: Knapsack DP (0/1, Bounded, Unbounded) Partition Equal Subset Sum Last Stone Weight II Ones and Zeros Coin Change Coin Change 2 Number of Dice Rolls with Target Sum Shopping Offers