線性 DP・Kadane Linear DP / Kadane
35 題（25 題以此為主技法）
🎯 何時用
一維序列上的最佳解，狀態只依賴前幾項（爬樓梯、打家劫舍、最大子陣列、LIS）。
🧩 模板心法
dp[i] 由 dp[i-1]/dp[i-2] 轉移；常可滾動成 O(1) 空間。Kadane：cur=max(x, cur+x)。
Easy 3 題
Medium 25 題
- #5Longest Palindromic Substring
- #91Decode Ways
- #152Maximum Product Subarray
- #198House Robber
- #213House Robber II
- #377Combination Sum IV
- #647Palindromic Substrings
- #416Partition Equal Subset Sum
- #120Triangle
- #256Paint House
- #343Integer Break
- #740Delete And Earn
- #837New 21 Game
- #983Minimum Cost For Tickets
- #1035Uncrossed Lines
- #1626Best Team with no Conflicts
- #1856Maximum Subarray Min Product
- #2140Solving Questions With Brainpower
- #2369Check if There is a Valid Partition For The Array
- #2466Count Ways to Build Good Strings
- #139Word Break
- #300Longest Increasing Subsequence
- #322Coin Change
- #279Perfect Squares
- #673Number of Longest Increasing Subsequence