How should I practice Delimited Morse Decoding and Word Segmentation?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Delimited Morse Decoding and Word Segmentation associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Delimited Morse Decoding and Word Segmentation

Google● MediumNEW GRADONSITE INTERVIEW

Learn

Problem statement

Decode an uppercase-English Morse message that uses the literal string xxx between encoded letters.

When sharedDelimiter is false, xxxxx separates words. Return the single decoded lowercase sentence.
When sharedDelimiter is true, every separator is xxx. Decode the continuous lowercase letter string, then return every sentence obtainable by splitting it into words from dictionary.

Return sentences in lexicographic order. Dictionary words are unique lowercase strings. The encoded input is valid Morse for letters A–Z. Empty input decodes to one empty sentence.

Function

decodeDelimitedMorse(encoded: String, dictionary: String[], sharedDelimiter: boolean) → String[]

Examples

Example 1

encoded = ".-xxx-..xxxxx..-"dictionary = []sharedDelimiter = falsereturn = ["ad u"]

.-, -.., and ..- decode to A, D, and U; five x characters separate the two words.

Example 2

encoded = ".-xxx-..xxx..-"dictionary = ["ad","u","a","du"]sharedDelimiter = truereturn = ["a du","ad u"]

The decoded letters are adu, which have two valid dictionary segmentations.

Example 3

encoded = ""dictionary = []sharedDelimiter = falsereturn = [""]

The empty message contains one empty sentence.

Constraints

0 <= encoded.length <= 2000.
0 <= dictionary.length <= 5000.
Dictionary words are unique lowercase English strings with length from 1 through 100.
At most 10000 valid sentences exist.