Question: How to recursively find out if string C is a blend of both substrings s1 and s2? For example S1 = DY NOGRASOAMA and S2

How to recursively find out if string C is a blend of both substrings s1 and s2?

For example S1 = DY NOGRASOAMA and S2 = AMICP RMMINGISZING we can create this blend: C = DYNAMICPROGRAMMINGISSOAMAZING

No code needed just explanation, explain what type of dynamic programming table you would use and what is the base case.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!