Help needed with this question

Revision en1, by iron_nicko, 2023-08-24 09:38:32

Question :

Find the minimum amount of Prefix-Strings
needed to make string B from the given list of strings A.

Input :

4
abc ka efgh k
efghkabc

Output: 3

Constraints:

1 <= N <= 100
1 <= |A| <= 100
1 <= |A[i]| <= 100
1 <= |B| <= 100
My Code

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English iron_nicko 2023-08-24 09:38:32 2461 Initial revision (published)