algorythms
Dynamic Programming
LC #97Hard

Interleaving String

Dynamic Programming
GoogleAmazonBloomberg

Problem

Check if s3 is formed by interleaving s1 and s2 while preserving their relative order.

dynamic-programmingstring

Constraints

  • 0 ≤ s1.length, s2.length ≤ 100
  • s3.length == s1.length + s2.length

Example

Inputs1 = "aabcc", s2 = "dbbca", s3 = "aadbbcbcac"
Outputtrue
Why

s3 interleaves s1 and s2 preserving their relative orders

Hints — reveal one at a time