leetcode-javascript/solutions/0804-unique-morse-code-words.js at development · Anuj9826/leetcode-javascript · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/**
 * Unique Morse Code Words
 * Time Complexity: O(N * L)
 * Space Complexity: O(N * L)
 */
var uniqueMorseRepresentations = function (words) {
  const morseEncodings = [
    ".-",
    "-...",
    "-.-.",
    "-..",
    ".",
    "..-.",
    "--.",
    "....",
    "..",
    ".---",
    "-.-",
    ".-..",
    "--",
    "-.",
    "---",
    ".--.",
    "--.-",
    ".-.",
    "...",
    "-",
    "..-",
    "...-",
    ".--",
    "-..-",
    "-.--",
    "--..",
  ];

  const charToMorseMapping = new Map();
  for (
    let iterationIndex = 0;
    iterationIndex < morseEncodings.length;
    iterationIndex++
  ) {
    const asciiCode = 97 + iterationIndex;
    const alphabetCharacter = String.fromCharCode(asciiCode);
    const currentMorseCode = morseEncodings[iterationIndex];
    charToMorseMapping.set(alphabetCharacter, currentMorseCode);
  }

  const uniqueRepresentationsSet = new Set();
  for (const inputWord of words) {
    const wordMorseParts = [];
    for (
      let characterPosition = 0;
      characterPosition < inputWord.length;
      characterPosition++
    ) {
      const currentLetter = inputWord[characterPosition];
      const letterMorseValue = charToMorseMapping.get(currentLetter);
      wordMorseParts.push(letterMorseValue);
    }
    const compiledTransformation = wordMorseParts.join("");
    uniqueRepresentationsSet.add(compiledTransformation);
  }

  return uniqueRepresentationsSet.size;
};