Problem: Minimum Number of Valid Strings to Form Target I

Try to solve the Minimum Number of Valid Strings to Form Target I problem.

Statement

You are given an array of strings words and a string target.

A string is considered valid if it is a prefix of at least one string present in words.

Return the minimum number of valid strings required to concatenate and form target. If it is impossible to form target using valid strings, return $-1$ .

Constraints:

$1 \leq$ words.length $\leq 100$
$1 \leq$ words[i].length $\leq 5 imes 10^3$
The sum of words[i].length across all elements is at most $10^5$ .
words[i] consists only of lowercase English letters.
$1 \leq$ target.length $\leq 5 imes 10^3$
target consists only of lowercase English letters.

Problem: Minimum Number of Valid Strings to Form Target I

Try to solve the Minimum Number of Valid Strings to Form Target I problem.

Statement

You are given an array of strings words and a string target.

A string is considered valid if it is a prefix of at least one string present in words.

Return the minimum number of valid strings required to concatenate and form target. If it is impossible to form target using valid strings, return $-1$ .

Constraints:

$1 \leq$ words.length $\leq 100$
$1 \leq$ words[i].length $\leq 5 imes 10^3$
The sum of words[i].length across all elements is at most $10^5$ .
words[i] consists only of lowercase English letters.
$1 \leq$ target.length $\leq 5 imes 10^3$
target consists only of lowercase English letters.

Problem: Minimum Number of Valid Strings to Form Target I

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: Minimum Number of Valid Strings to Form Target I

Statement

Examples

Understand the problem

Figure it out!

Try it yourself