How do you recognize a string DP problem?
Comparing two strings? Probably 2D (two-dimensional) DP with .
Looking for common structure? Think LCS pattern (match/skip).
Converting one string to another? Think Edit Distance pattern (multiple operations).
Counting ways? Same structure, but sum instead of max/min. The formula always asks: what happens at position based on whether characters match?