DSA Visualizations | Hello Interview

Word Break

DESCRIPTION (credit Leetcode.com)

You are provided with a string s and a set of words called wordDict. Write a function to determine whether s can be broken down into a sequence of one or more words from wordDict, where each word can appear more than once and there are no spaces in s. If s can be segmented in such a way, return true; otherwise, return false.

EXAMPLES

Input:


s = "catsandog", wordDict = ["cats","dog","sand","and","cat"]

Output:


false

Explanation: There is no valid segmentation of "catsanddog" into dictionary words from wordDict.

Input:


s = "hellointerview", wordDict = ["hello","interview"]

Output:


true

Explanation: Return true because "hellointerview" can be segmented as "hello" and "interview".
Note that you are allowed to reuse a dictionary word.

Run your code to see results here

Explanation

This solution uses bottom-up dynamic programming to solve the problem.

We create a boolean array dp of size n + 1 where n is the length of the input string. dp[i] is true if the first i characters of s can be segmented into a valid sequence of dictionary words. dp[0] is True because the empty string is a valid sequence - all other values are false to start.


def wordBreak(s, wordDict):
  wordSet = set(wordDict)
  dp = [False] * (len(s) + 1)
  dp[0] = True # Empty string is a valid break

  for i in range(1, len(s) + 1):
    for j in range(i):
      sub = s[j:i]
      if dp[j] and sub in wordSet:
        dp[i] = True
        break

  return dp[len(s)]

word break

0 / 1

We then use a for-loop i which goes from 1 to n to iterate through the string. Inside the body of this loop, we determine the correct value for dp[i]. We do this by using another for-loop j, which goes from 0 to i and represents the start of the substring we are considering. If dp[j] is true and the substring from j to i (sub) is in the dictionary, then we have found a valid segmentation, and can therefore set dp[i] to True.


def wordBreak(s, wordDict):
  wordSet = set(wordDict)
  dp = [False] * (len(s) + 1)
  dp[0] = True # Empty string is a valid break

  for i in range(1, len(s) + 1):
    for j in range(i):
      sub = s[j:i]
      if dp[j] and sub in wordSet:
        dp[i] = True
        break

  return dp[len(s)]

i = 1

0 / 11

Iterating until we set dp[i] = True for the first time.

As soon as we find a valid segmentation, we can break out of the inner for-loop and move on to the next character in the string.

Finally, after we finished iterating, we return dp[n] which is the value of the last element in the array. This value will be True if the entire string can be segmented into valid dictionary words, and False otherwise.

Complexity Analysis

Time Complexity: O(n²) where n is the length of the input string s. Space Complexity: O(n + m) where n is the length of the input string s and m is the length of wordDict for the dp array and the additional space used to create wordSet from wordDict.

Solution


def wordBreak(s, wordDict):
  wordSet = set(wordDict)
  dp = [False] * (len(s) + 1)
  dp[0] = True # Empty string is a valid break

  for i in range(1, len(s) + 1):
    for j in range(i):
      sub = s[j:i]
      if dp[j] and sub in wordSet:
        dp[i] = True
        break

  return dp[len(s)]

word break

0 / 88

Alternative Solution

An alternative solution follows the same bottom-up approach. We use the same for loop to iterate through the string, but instead of iterating over all substrings ending at i, we instead iterate over all words in the dictionary. If the current word matches the substring ending at i and if dp[i - word.length] is True, then we have found a valid segmentation and can set dp[i] to True.


def wordBreak(s, wordDict):
  dp = [False] * (len(s) + 1)
  dp[0] = True # Empty string is a valid break

  for i in range(1, len(s) + 1):
    for word in wordDict:
      if i >= len(word) and dp[i - len(word)]:
        sub = s[i - len(word):i]
        if sub == word:
          dp[i] = True
          break

  return dp[len(s)]

word break

0 / 65

Complexity Analysis

Time Complexity: O(n * m) where n is the length of the input string s and m is the length of wordDict. Space Complexity: O(n) where n is the length of the input string s for the dp array.

Next: Maximum Profit in Job Scheduling

Your account is free and you can post anonymously if you choose.

Sort By

Loading comments...

Back to Home

Eliminating Pairs

Overview

Container With Most Water

3-Sum

Triangle Numbers

Pointers as Regions

Move Zeroes

Sort Colors

Trapping Rain Water

Variable-Length

Overview

Longest Substring Without Repeating Characters

Longest Repeating Character Replacement

Fixed-Length

Overview

Maximum Sum of Subarrays of Size K

Max Points You Can Obtain From Cards

Max Sum of Distinct Subarrays Length k

Overview

Can Attend Meetings

Insert Interval

Non-Overlapping Intervals

Merge Intervals

Employee Free Time

Overview

Valid Parentheses

Decode String

Longest Valid Parentheses

Monotonic Stack

Overview

Daily Temperatures

Largest Rectangle in Histogram

Overview

Linked List Cycle

Palindrome Linked List

Remove Nth Node From End of List

Reorder List

Swap Nodes in Pairs

Overview

Apple Harvest (Koko Eating Bananas)

Search in Rotated Sorted Array

Overview

Kth Largest Element in an Array

K Closest Points to Origin

Find K Closest Elements

Merge K Sorted Lists

Introduction

Binary Trees

Overview

Level Order Sum

Rightmost Node

Zigzag Level Order

Maximum Width of Binary Tree

Graphs

Overview

Minimum Knight Moves

Rotting Oranges

01-Matrix

Bus Routes

Overview

Word Search

Solution Space Trees

Subsets

Generate Parentheses

Combination Sum

Topological Sort

Overview

Course Schedule

Course Schedule II

Fundamentals

Solving a Question with Dynamic Programming

Counting Bits

Decode Ways

Maximal Square

Unique Paths

Longest Increasing Subsequence

Word Break

Maximum Profit in Job Scheduling

Overview

Best Time to Buy and Sell Stock

Gas Station

Jump Game

Overview

Implement Trie Methods

Prefix Matching

Overview

Count Vowels in Substrings

Subarray Sum Equals K

Spiral Matrix

Rotate Image

Set Matrix Zeroes

Longest Increasing Subsequence

Maximum Profit in Job Scheduling

Word Break

DESCRIPTION (credit Leetcode.com)

EXAMPLES

Input:


s = "catsandog", wordDict = ["cats","dog","sand","and","cat"]

Output:


false

Explanation: There is no valid segmentation of "catsanddog" into dictionary words from wordDict.

Input:


s = "hellointerview", wordDict = ["hello","interview"]

Output:


true

Explanation: Return true because "hellointerview" can be segmented as "hello" and "interview".
Note that you are allowed to reuse a dictionary word.

Run your code to see results here

Explanation

This solution uses bottom-up dynamic programming to solve the problem.


def wordBreak(s, wordDict):
  wordSet = set(wordDict)
  dp = [False] * (len(s) + 1)
  dp[0] = True # Empty string is a valid break

  for i in range(1, len(s) + 1):
    for j in range(i):
      sub = s[j:i]
      if dp[j] and sub in wordSet:
        dp[i] = True
        break

  return dp[len(s)]

word break

0 / 1


def wordBreak(s, wordDict):
  wordSet = set(wordDict)
  dp = [False] * (len(s) + 1)
  dp[0] = True # Empty string is a valid break

  for i in range(1, len(s) + 1):
    for j in range(i):
      sub = s[j:i]
      if dp[j] and sub in wordSet:
        dp[i] = True
        break

  return dp[len(s)]

i = 1

0 / 11

Iterating until we set dp[i] = True for the first time.

As soon as we find a valid segmentation, we can break out of the inner for-loop and move on to the next character in the string.

Complexity Analysis

Solution


def wordBreak(s, wordDict):
  wordSet = set(wordDict)
  dp = [False] * (len(s) + 1)
  dp[0] = True # Empty string is a valid break

  for i in range(1, len(s) + 1):
    for j in range(i):
      sub = s[j:i]
      if dp[j] and sub in wordSet:
        dp[i] = True
        break

  return dp[len(s)]

word break

0 / 88

Alternative Solution


def wordBreak(s, wordDict):
  dp = [False] * (len(s) + 1)
  dp[0] = True # Empty string is a valid break

  for i in range(1, len(s) + 1):
    for word in wordDict:
      if i >= len(word) and dp[i - len(word)]:
        sub = s[i - len(word):i]
        if sub == word:
          dp[i] = True
          break

  return dp[len(s)]

word break

0 / 65

Complexity Analysis

Time Complexity: O(n * m) where n is the length of the input string s and m is the length of wordDict. Space Complexity: O(n) where n is the length of the input string s for the dp array.

Next: Maximum Profit in Job Scheduling

Your account is free and you can post anonymously if you choose.

Sort By

Loading comments...

BlogBehavioral Interview Examples Interviewing for Experienced SWEs All Blog Posts

Compare UsCompare to Interviewing.io

LinksFAQ Schedule Mock Interviews Pricing Become a Coach Our Coaches Learn System Design Learn DSA Guided Practice Hello Interview Premium

LegalTerms and Conditions Privacy Policy

Contactsupport@hellointerview.com7511 Greenwood Ave North
Unit #4238 Seattle, WA 98103