Leetcode 3291. Minimum Number of Valid Strings to Form Target I

Given words and a target, each valid piece is any prefix of any word; return the minimum number of such prefixes that concatenate to form target, or -1 if impossible. This is a shortest-segmentation problem based on prefix matching (solvable with DP/trie) with target length up to ~5k and total words length up to ~1e5.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late May, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3291. Minimum Number of Valid Strings to Form Target I

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact