Solution: Verifying an Alien Dictionary
Let's solve the Verifying an Alien Dictionary problem using the Topological Sort pattern.
Statement
In an alien language, the alphabet consists of the same lowercase English letters but arranged in a different order.
Given a list of words, words
, written in this alien language, and a string order
representing the order of the alien alphabet (as a permutation of lowercase letters), return TRUE if the words are sorted lexicographically according to order
; otherwise, return FALSE.
Note: A word
a
is considered lexicographically smaller than wordb
if:
At the first position where the two words differ, the character in
a
comes before the character inb
in the givenorder
string.If one word is a prefix of the other (and all compared characters are the same), then the shorter word is considered smaller.
Constraints:
-
words.length
-
words[i].length