Available question text
Given a string formed by concatenating some words from a given list, determine whether (and how) it can be split back into those original words or enumerate all valid splits, handling ambiguous/overlapping prefixes. Use efficient prefix matching (trie) with DFS/backtracking or dynamic programming to prune impossible splits.
Related questions
Continue with questions that share topics or the same question type.
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
No company association
Leetcode 555. Split Concatenated Strings
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source