LeetCode: Verifying An Alien Dictionary Solution

1/**
2 * @param {string[]} words
3 * @param {string} order
4 * @return {boolean}
5 */
6var isAlienSorted = function (words, order) {
7  const N = words.length
8  order = order.split("").reduce((acc, char, i) => acc.set(char, i), new Map())
9  let sorted = true
10  for (let i = 0; i < N - 1; i++) {
11    for (let j = 0; j < words[i].length; j++) {
12      if (order.get(words[i][j]) === order.get(words[i + 1][j])) {
13        continue
14      } else if (order.get(words[i][j]) < order.get(words[i + 1][j])) {
15        break
16      } else {
17        sorted = false
18      }
19    }
20  }
21  return sorted
22}