304 North Cardinal St.
Dorchester Center, MA 02124

# Unique Morse Code Words LeetCode Solution

## Problem – Unique Morse Code Words

International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows:

• `'a'` maps to `".-"`,
• `'b'` maps to `"-..."`,
• `'c'` maps to `"-.-."`, and so on.

For convenience, the full table for the `26` letters of the English alphabet is given below:

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

Given an array of strings `words` where each word can be written as a concatenation of the Morse code of each letter.

• For example, `"cab"` can be written as `"-.-..--..."`, which is the concatenation of `"-.-."``".-"`, and `"-..."`. We will call such a concatenation the transformation of a word.

Return the number of different transformations among all words we have.

Example 1:

``````Input: words = ["gin","zen","gig","msg"]
Output: 2
Explanation: The transformation of each word is:
"gin" -> "--...-."
"zen" -> "--...-."
"gig" -> "--...--."
"msg" -> "--...--."
There are 2 different transformations: "--...-." and "--...--.".``````

Example 2:

``````Input: words = ["a"]
Output: 1``````

Constraints:

• `1 <= words.length <= 100`
• `1 <= words[i].length <= 12`
• `words[i]` consists of lowercase English letters.

### Unique Morse Code Words LeetCode Solution in Java

``````    public int uniqueMorseRepresentations(String[] words) {
String[] d = {".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", "--", "-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", "-.--", "--.."};
HashSet<String> s = new HashSet<>();
for (String w : words) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < w.length(); ++i)
sb.append(d[w.charAt(i) - 'a']);
}
return s.size();
}``````

### Unique Morse Code Words LeetCode Solution in C++

``````    int uniqueMorseRepresentations(vector<string>& words) {
vector<string> d = {".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", "--", "-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", "-.--", "--.."};
unordered_set<string> s;
for (auto w : words) {
string code;
for (auto c : w) code += d[c - 'a'];
s.insert(code);
}
return s.size();
}``````

### Unique Morse Code Words LeetCode Solution in Python

``````    def uniqueMorseRepresentations(self, words):
d = [".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", "--",
"-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", "-.--", "--.."]
return len({''.join(d[ord(i) - ord('a')] for i in w) for w in words})``````
##### Unique Morse Code Words LeetCode Solution Review:

In our experience, we suggest you solve this Unique Morse Code Words LeetCode Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the Unique Morse Code Words LeetCode Solution

Find on LeetCode

##### Conclusion:

I hope this Unique Morse Code Words LeetCode Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Coding Solutions >>

LeetCode Solutions

Hacker Rank Solutions

CodeChef Solutions