Last active
February 15, 2021 18:16
-
-
Save FelixLuciano/69e0b1e9bb734189f0434af8e190d165 to your computer and use it in GitHub Desktop.
rendezvous with cassidoo #183 - Interview question of the week
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* From: https://buttondown.email/cassidoo/archive/to-know-how-much-there-is-to-know-is-the/ | |
* @param {string} str String | |
* @param {string[]} dict A list of non-empty words | |
* @returns {string[]} Return all possible sentences | |
* @example | |
* const str = "penpineapplepenapple" | |
* const dict = ["apple", "pen", "applepen", "pine", "pineapple"] | |
* | |
* $ makeSentence(str, dict) | |
* -> [ | |
* "pen pine apple pen apple", | |
* "pen pineapple pen apple", | |
* "pen pine applepen apple" | |
* ] | |
*/ | |
function makeSentence(str, dict) { | |
let sentences = [""] | |
for (let i = 0; i < sentences.length;) { | |
const sentence = sentences[i] | |
const flat = sentence.replaceAll(" ", "") | |
let j = 0 | |
for (let item of dict) | |
if (str.startsWith(flat + item)) { | |
sentences[i + j] = sentence + (sentence.length > 0 ? " " : "") + item | |
while (i + j in sentences) j++ | |
} | |
if (j === 0) i++ | |
} | |
return sentences | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment