Word Break

#139
Medium
Dynamic Programming
O(n^2)
O(n)
Amazon
Facebook
Microsoft
Google
View on LeetCode

Problem Description

Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.