Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
recursion solution in Clear category for Count Morse by kdim
D = {
"a": ".-", "b": "-...",
"c": "-.-.", "d": "-..",
"e": ".", "f": "..-.",
"g": "--.", "h": "....",
"i": "..", "j": ".---",
"k": "-.-", "l": ".-..",
"m": "--", "n": "-.",
"o": "---", "p": ".--.",
"q": "--.-", "r": ".-.",
"s": "...", "t": "-",
"u": "..-", "v": "...-",
"w": ".--", "x": "-..-",
"y": "-.--", "z": "--.."}
def count_morse(mes: str, let: str) -> int:
if not let:
return 1
return sum(count_morse(mes.removeprefix(D[s]), let.replace(s, '')) for s in let if mes.startswith(D[s]))
April 19, 2023
