Minimum Number of Valid Strings to Form Target I: coding question

Available question text

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.

Continue with questions that share topics or the same question type.

Minimum Number of Valid Strings to Form Target II
Coding
Minimum Number of Increments on Subarrays to Form a Target Array
Coding
Minimum Number of Groups to Create a Valid Assignment
Coding
Minimum Number of Primes to Sum to Target
Coding

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Meta
Leetcode 3291. Minimum Number of Valid Strings to Form Target I
Reported May 29, 2025 · 2 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source

Minimum Number of Valid Strings to Form Target I

Available question text

Related questions

Minimum Number of Valid Strings to Form Target I

Available question text

Related questions