New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Morse Code To English

Contributed by

Ashwani

Last Updated: 23 Feb, 2023

Easy

0/40

Avg time to solve 15 mins

Success Rate 85 %

11 upvotes

Problem Statement

You are given a string of length N representing the morse code(s). You have to convert this code into the corresponding alphanumeric code containing small case english alphabet[a-z] and digits[0-9].

For your convenience, the full table for the 26 letters of the English alphabet and 10 numeric digits is given below:

list = [ ".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", "--", "-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", "-.--", "--..", "-----", ".----", "..---", "...--", "....-", ".....", "-....", "--...", "---..", "----." ]      

where list[0] represents morse code for ‘a’, list[1] represents morse code for ‘b’, and list[35] represents morse code for ‘9’. Similarly, each letter and numeric is mapped with a morse code given in the list.

Detailed explanation ( Input/output format, Notes, Images )

Input Format:

The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then the test cases follow.

The first line of each test case contains the morse code in the form of a string.

Output format :

For each test case, print the equivalent alphanumeric code of the given morse code in a separate line.

Note:

You do not need to print anything, it has already been taken care of. Just implement the given function.

Constraints:

1 <= T <= 10
1 <= N <= 5*(10^5)

Time Limit: 1sec

Sample Input 1 :

2
-.-. --- -.. .. -. --.
-. .. -. .--- .- ...

Sample Output 1 :

coding
ninjas

Explanation For Sample Input 1 :

In the first test case, On splitting the given string on the basis of space the list we get is :  [ "-.-.", "---", "-..", "..",  "-.", "--." ] where “-.-.” is morse code for ‘c’ and similarly further in the string.

In the second case, On splitting the given string on the basis of space the list we get is : [ "-.", "..", "-.", ".---", ".-", "..." ], where “-.” is morse code for ‘n’ and similarly further in the string.

Sample Input 2 :

2
----. ---.. ....- ..... ----- 
-.. .... --- -. .. --... --...

Sample Output 2 :

98450
dhoni77

Auto

Console