Word Break (Trie)
Hard Accuracy: 51.68% Submissions: 2490 Points: 8

Given a string A and a dictionary of n words B, find out if A can be segmented into a space-separated sequence of dictionary words.

Example 1:

Input:
n = 12
B = { "i", "like", "sam", "sung", "samsung",
"mobile","ice","cream", "icecream", "man",
"go", "mango" }, A = "ilike"
Output: 1
Explanation: The string can be segmented as
"i like".


â€‹Example 2:

Input:
n = 12
B = { "i", "like", "sam", "sung",
"samsung", "mobile","ice","cream", "icecream",
"man", "go", "mango" }, A = "ilikesamsung"
Output: 1
Explanation: The string can be segmented as
"i like samsung" or "i like sam sung".


Complete wordBreak() function which takes a string and list of strings as a parameter and returns 1 if it is possible to break words, else return 0. You don't need to read any input or print any output, it is done by driver code.

Expected time complexity: O(n*l) wwhere l is the leght of longest string present in dictionary
â€‹Expected auxiliary space: O(|A| + k) , where k = sum of length of all strings present in B

Constraints:
1 <= N <= 12
1 <= s <=1000 , where s = length of string A
The length of each word is less than 15.

We are replacing the old Disqus forum with the new Discussions section given below.