Skip to content

Files

Latest commit

4281f03 · Nov 22, 2019

History

History

problem022

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Nov 22, 2019
Nov 22, 2019
Nov 22, 2019

Daily Coding Problem: Problem #22 [Medium]

Good morning! Here's your coding interview problem for today.

This problem was asked by Microsoft.

Given a dictionary of words and a string made up of those words (no spaces), return the original sentence in a list. If there is more than one possible reconstruction, return any of them. If there is no possible reconstruction, then return null.

For example, given the set of words 'quick', 'brown', 'the', 'fox', and the string "thequickbrownfox", you should return ['the', 'quick', 'brown', 'fox'].

Given the set of words 'bed', 'bath', 'bedbath', 'and', 'beyond', and the string "bedbathandbeyond", return either ['bed', 'bath', 'and', 'beyond] or ['bedbath', 'and', 'beyond'].