How should I practice Sort by Variable-Length Alphabet Tokens?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP phone screen problems in FastPrep.

Is Sort by Variable-Length Alphabet Tokens associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP phone screen coding practice problem when the problem catalog has that company and stage context.

Sort by Variable-Length Alphabet Tokens

Bloomberg LP● HardNEW GRADPHONE SCREEN

Learn

Problem statement

alphabet lists language symbols from smallest to largest; each symbol is a nonempty string and lengths may vary. Every input word has exactly one tokenization into these symbols.

Sort words lexicographically by their token-rank sequences. If one sequence is a prefix of another, the shorter word comes first.

Function

sortTokenAlphabetWords(alphabet: String[], words: String[]) → String[]

Examples

Example 1

alphabet = ["ba","aa","cb","abc","d","dd"]words = ["cbba","abccb","aaba","baaa"]return = ["baaa","aaba","cbba","abccb"]

The unique token sequences begin with ranks 0,1,2,3 respectively.

Constraints

Every word is uniquely tokenizable.
Total input length is at most 10^5.