Coding - Verifying an Alien Dictionary

Problem Statement

In an alien language, the order of the alphabet is different from the English alphabet. Given a string order representing the order of the alphabet in the alien language and a list of strings words, where each word is composed of the alien alphabet, determine if the words are sorted lexicographically according to the alien alphabet.

To solve this problem, you need to:

1. Understand the alien alphabet order given by the string order.
2. Compare the words in the list words based on the alien alphabet order.
3. Return true if the words are sorted lexicographically according to the alien order, or false otherwise.

Examples

Example 1: Input: order = "za", words = ["z","zaa"] Output: true Explanation: The first word is "z" and the second word is "zaa". Since 'z' is the first character according to the order and "zaa" is the second word, the words are sorted lexicographically.

Example 2: Input: order = "zb", words = ["z","zb"] Output: false Explanation: The first word is "z" and the second word is "zb". According to the order "zb", 'z' should be followed by 'b', so the words are not sorted lexicographically.

Example 3: Input: order = "abc", words = ["abcd","abc"] Output: true Explanation: The first word is "abcd" and the second word is "abc". Since "abc" is a prefix of "abcd", the words are sorted lexicographically.

Constraints

• 1 <= words.length <= 100
• 1 <= words[i].length <= 100
• order.length == 26
• order consists of all lowercase English letters.
• All the characters in words[i] are in order.
• words[i] consists of only lowercase English letters.

Hints

• You can create a mapping from each letter in the alien alphabet to its index in the order string.
• Compare words based on the mapping to determine if they are sorted lexicographically.
• Handle cases where one word is a prefix of another.

NOT_FOUND