Problem · String
First Valid Word Segmentation
Problem statement
Given a continuous lowercase string s and an array dictionary representing the words accepted by isWord, split s into a sequence of dictionary words whose concatenation is exactly s.
The problem statement continues
ProExamples
Example 1
s = "myhousehavecat"dictionary = ["my","house","have","cat"]return = ["my","house","have","cat"]Each returned piece is accepted by the dictionary, and their concatenation is myhousehavecat.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$9/month
Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week