LC-0139 Medium LeetCode

139. Word Break

Array Hash Table String Dynamic Programming Trie Memoization

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 48% Topics: Array, Hash Table, String, Dynamic Programming, Trie, Memoization

Reading material

Arrays & Hashing 12 min Strings 12 min 1-D Dynamic Programming 16 min

Reference solution (spoiler · python)

# Time:  O(n * l^2)
# Space: O(n)

class Solution(object):
    def wordBreak(self, s, wordDict):
        """
        :type s: str
        :type wordDict: Set[str]
        :rtype: bool
        """
        n = len(s)

        max_len = 0
        for string in wordDict:
            max_len = max(max_len, len(string))

        can_break = [False for _ in xrange(n + 1)]
        can_break[0] = True
        for i in xrange(1, n + 1):
            for l in xrange(1, min(i, max_len) + 1):
                if can_break[i-l] and s[i-l:i] in wordDict:
                    can_break[i] = True
                    break

        return can_break[-1]

Solution from kamyu104/LeetCode-Solutions · MIT