Two Strings: LCS and Edit Distance

When a question gives you two strings, the state is a position in each:

f(i, j) = the answer for a[i..] and b[j..]

• Characters match: use them and move both pointers.
• They don’t match: try each allowed move and keep the best.
• Base case: one string is used up.