Leetcode 555. Split Concatenated Strings
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.