International Morse Code maps each of the $26$ lowercase English letters to a unique sequence of dots and dashes as follows:

[".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", "--", "-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", "-.--", "--.."]

Each element in the sequence corresponds to a letter from 'a' through 'z' in alphabetical order.

The transformation of a word is formed by concatenating the Morse code representations of each of its individual characters.

Given an array of strings words, return the number of distinct Morse code transformations formed by all words in words.

Constraints:

• $1 \leq$ words.length $\leq 100$

• $1 \leq$ words[i].length $\leq 12$

• words[i] consists of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.