[".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","- -","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.-- ","--.."]
Morse Code (python )
Morse code maps each letter of the alphabet to a series of dashes and dots (a = .-). The list of the Morse code for all English letters (from a to z) is provided below:
[".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","- -","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.-- ","--.."]
Your goal here is to implement a function that takes a list of strings as its only parameter (called “words”). Each of the words can be transformed to Morse code by concatenation of a number of the above strings (without spaces). For example, the transformation of “ab” will be “.--...” (“.-” + “-...”). The word “ems” will also have the same transformation “.--...” (“.” + “--” + “...”).
In this function, the goal is to return the number of the unique transformations in “words” list. Here is an example (none of this is needed to be printed, the function will only return one integer):
Words = [“ab”, “a”, “ems”]
Returned value: 2
Explanation: the transformation of each word is:
“ab” = “.--...”
“a” = “.-”
“ems” = “.--...”
There are a total of 2 unique transformations: “.--...” and “.-”.
You should be using dictionaries for this question.
Step by step
Solved in 2 steps
