Zipped String

[TiwariPreeti]

Given lowercase alphabet strings a, b, and c return whether there's any way of obtaining c by merging characters in order from a and b.

Constraints:

0 ≤ n ≤ 1,000 where n is the length of a 0 ≤ m ≤ 1,000 where m is the length of b 0 ≤ k ≤ 1,000 where k is the length of c

Example 1 Input:- a = "abc" b = "def" c = "abdefc" Output:- true

https://binarysearch.com/problems/Zipped-String

Tags for the question(eg - Array, Basic, Stack, etc.) - Dynamic Programming String

[TiwariPreeti]

Please assign me this @akshitagupta15june

[TiwariPreeti]

Please add label hacktoberfest-accepted

[anish853]

Hey @TiwariPreeti @akshitagupta15june Kindly assign this problem to me.