How should I practice Word Break with a Reusable Dictionary?

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

Is Word Break with a Reusable Dictionary associated with Meta?

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

Problem · String

Word Break with a Reusable Dictionary

Learn this problem

● Medium

MetaFULLTIMEONSITE INTERVIEW

See Meta hiring insights

Problem statement

Given a string s and a set of nonempty dictionary words, return whether s can be segmented into a sequence of one or more dictionary words.

Each dictionary word may be reused any number of times. The segmentation must cover the entire string in order. The empty string is segmentable using zero words.

Function

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

Examples

Example 1

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

Split the string as leet | code.

Example 2

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

The word apple is reused in apple | pen | apple.

Example 3

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

Every possible prefix decomposition leaves a suffix that is not in the dictionary.

Constraints

0 <= s.length <= 5000.
0 <= dictionary.length <= 5000.
1 <= dictionary[i].length <= 100.
s and every dictionary word contain only lowercase English letters.
Dictionary words are unique.