How should I practice Word Break?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Word Break associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Word Break

Google● MediumINTERNONSITE INTERVIEW

Learn

Problem statement

Given a string s and an array of dictionary words wordDict, return true if s can be split into a sequence of one or more dictionary words. Otherwise, return false.

All words in wordDict are available for the entire call, and a word may be reused multiple times. Dictionary membership uses exact string equality; duplicate entries do not change the result.

Function

wordBreak(s: String, wordDict: String[]) → boolean

Examples

Example 1

s = "leetcode"wordDict = ["leet","code"]return = true

Split s as leet + code. Both pieces belong to wordDict.

Example 2

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

The prefixes cats and cat both lead to suffixes that cannot be fully segmented.

Example 3

s = "applepenapple"wordDict = ["apple","pen"]return = true

Split s as apple + pen + apple. Reusing apple is allowed.

Constraints

1 <= s.length <= 300.
1 <= wordDict.length <= 1000.
1 <= wordDict[i].length <= 20.
Every dictionary entry is non-empty.