📌📌Python3 || ⚡347 ms, faster than 91.39% of Python3
\ndef findAllConcatenatedWordsInADict(self, words: List[str]) -> List[str]:\n        wordset = set(words)\n        result = []\n        def dfs(word, wordset):\
```\ndef findAllConcatenatedWordsInADict(self, words: List[str]) -> List[str]:\n        wordset = set(words)\n        result = []\n        def dfs(word, wordset):\n            if word == "":\n                return True\n            for i in range(len(word)):\n                if word[:i+1] in wordset:\n                    if dfs(word[i+1:], wordset):\n                        return True\n            return False\n        for word in words:\n            wordset.remove(word)\n            if dfs(word, wordset):\n                result.append(word)\n            wordset.add(word)\n        return result\n```
['Depth-First Search', 'Ordered Set', 'Python', 'Python3']