Search⌘ K
AI Features

Solution: Interleaving String

Understand how to apply dynamic programming to check if a string is formed by interleaving two other strings. Learn to use a space-efficient 1D DP array to track subproblem solutions and preserve character order while solving this classic coding interview problem.

Statement

You’re given three strings: s1, s2, and s3. Your task is to determine whether s3 can be formed by interleaving s1 and s2.

Interleaving means you take both strings and break them into smaller pieces (substrings), then merge those pieces while preserving the left-to-right order of characters within each original string.

The final mixed string might look like any of the following:

  1. s11+s21+s12+s22+s1_1 + s2_1 + s1_2 + s2_2 + \dots ...