I approached the challenge by implementing a trie and carrying out a depth-1st lookup. Here is the code: Given an assortment of strings phrases (without duplicates), return the many concatenated words and phrases https://mahanshabake.com/computer/hp/hp-server/