Python3 Solution beats 100%

  • 0

    This is the python version of this post written by @JayS03. Surprisingly, the runtime beats 100% of python 3 submissions.

    class Solution:
        def findAllConcatenatedWordsInADict(self, words):
            :type words: List[str]
            :rtype: List[str]
            res = []
            words_dict = set(words)
            for word in words:
                if self.check(word, words_dict) is True:
            return res
        def check(self, word, d):
            if word in d:
                return True
            for i in range(len(word),0, -1):
                if word[:i] in d and self.check(word[i:], d):
                    return True
            return False

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.