How can I write a code to solve such problem? (dynammic programming)

[cce917]

Given a set S of m strings and a target string t we want to check whether or not t is the concatenation of some of the m strings while allowing repetition. Example : S= {ab, dbe, eaa, ea} and t=eaabdbeab. Here the answer is YES, t=ea ab dbe ab.

Key: I know that I should solve this using dynamic programming and I got this hint :
I should consider solving the following set of subproblems: can a prefix of T of length k be represented as a concatenation of some strings from S? These can be solved with a dynamic programming approach for all k from 1 up to the total length of T. The largest of these subproblems is the actual problem we want to solve.
But how can I write the code?

Thank you.

[Matticus]

Well, I'm happy you seemed to have scanned over the rules and used code tags - but you're only supposed to use them on code, not your actual question.

You also posted in the "general discussions" forum, so we don't know which language you're supposed to be using for this assignment.

Please see the homework policy - you need to attempt solving the problem yourself, and ask specific questions when you get stuck. "How can I write this code" is too general of a question to answer, and nobody is going to do your entire assignment for you.

Finally, don't cross-post your question to various forums. It's bad etiquette.