Package g3201_3300.s3291_minimum_number_of_valid_strings_to_form_target_i

Class Solution

java.lang.Object
g3201_3300.s3291_minimum_number_of_valid_strings_to_form_target_i.Solution
public class Solution extends Object
3291 - Minimum Number of Valid Strings to Form Target I.

Medium

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

A string x is called valid if x is a prefix of any string in words.

Return the minimum number of valid strings that can be concatenated to form target. If it is not possible to form target, return -1.

A prefix of a string is a substring that starts from the beginning of the string and extends to any point within it.

Example 1:

Input: words = [“abc”,“aaaaa”,“bcdef”], target = “aabcdabc”

Output: 3

Explanation:

The target string can be formed by concatenating:

  • Prefix of length 2 of words[1], i.e. "aa".
  • Prefix of length 3 of words[2], i.e. "bcd".
  • Prefix of length 3 of words[0], i.e. "abc".

Example 2:

Input: words = [“abababab”,“ab”], target = “ababaababa”

Output: 2

Explanation:

The target string can be formed by concatenating:

  • Prefix of length 5 of words[0], i.e. "ababa".
  • Prefix of length 5 of words[0], i.e. "ababa".

Example 3:

Input: words = [“abcdef”], target = “xyz”

Output: -1

Constraints:

  • 1 <= words.length <= 100
  • 1 <= words[i].length <= 5 * 103
  • The input is generated such that sum(words[i].length) <= 105.
  • words[i] consists only of lowercase English letters.
  • 1 <= target.length <= 5 * 103
  • target consists only of lowercase English letters.

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • minValidStrings

      public int minValidStrings(String[] words, String target)