1. You will be given a string and a dictonary of words 2. You need to find if the given string can be broken(space-segmented) into one or more dictonary words 3. Return true if possible, else false 3. Input and output is handled for you 4. It is a functional problem ,please do not modify main() NOTE: You can use a dictonary word more than once
Input Format
Input is handled for you
Output Format
Output is handled for you
Constraints
dictonary has unique words
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
sunrisesintheeast 5 sun east in rises the
Output
true