Concatenated Words

Solve Concatenated Words.

Difficulty

hard

Companies

GoogleAmazonMicrosoftMetaTwitter

Topic

Trietrie trie-dp

Examples

Input: []

Output: 0

Input: ["a"]

Output: 0

Hints

Build a Trie with all words, then check each word if it can be formed.

Use DP to check if a word can be formed by concatenating other words from the list.

Sort words by length (shortest first) to ensure subwords are available.

Related Problems

implement-trie-prefix-tree

Concatenated Words

Solve **Concatenated Words**. This entry was scaffolded in Trie Mastery migration and should be refined with full statement/examples.