Python naive solution beats 99% and 100%
\nclass Solution(object):\n    def findAllConcatenatedWordsInADict(self, words):\n        words = set(words)\n\t\t\n        def is_concatenated(word):\n        
```\nclass Solution(object):\n    def findAllConcatenatedWordsInADict(self, words):\n        words = set(words)\n\t\t\n        def is_concatenated(word):\n            for i in range(1, len(word)):\n                if word[:i] in words and (word[i:] in words or is_concatenated(word[i:])):\n                    return True\n            return False\n        \n        return [word for word in words if is_concatenated(word)]\n```
[]