Rolling-row dynamic programming [mp]

Micro pattern¶

Description¶

Keep only the previous row or a safely updated current row of a two-dimensional recurrence.

Problems¶

• 62. Unique Paths (Top Medium)
• 64. Minimum Path Sum (Dynamic Programming)
• 63. Unique Paths II (Dynamic Programming)
• 120. Triangle (Dynamic Programming)
• 931. Minimum Falling Path Sum (Dynamic Programming)
• 221. Maximal Square (Dynamic Programming)
• 516. Longest Palindromic Subsequence (Dynamic Programming)
• 72. Edit Distance (Dynamic Programming)
• 712. Minimum ASCII Delete Sum for Two Strings (Dynamic Programming)
• 115. Distinct Subsequences (Dynamic Programming)
• 1143. Longest Common Subsequence (Dynamic Programming)
• 1035. Uncrossed Lines (Dynamic Programming)
• 1312. Minimum Insertion Steps to Make a String Palindrome (Dynamic Programming)