I approached the issue by employing a trie and accomplishing a depth-initial search. Here's the code:

Given an assortment of strings text (without duplicates), return many of the concatenated words in the specified list of

A concatenated term is defined to be a string that may be comprised fully of a minimum of two shorter text read more (not necesssarily distinctive) while in the provided array.