This one is more like a math problem, of course regex might help.

If it's the problem of not understand the description, please let me know.

You're just supposed to solve the kata. How you will do it is up to you.

To be sure you understood correctly: one call of beep is equivalent to one -or . or ... It has to be able to differ in execution time each time its called based on the message in the buffer. The decoder will execute beep multiple times per message. The decoder will continue to call beepuntil one execution of beeptakes a very small (no) time to excecute. Then the times measured will be translated back into the message.

So first of all both functions dont need to return anything ^^. You are writing a class Morser.

add_to_buffer will add the message to the buffer of the Morser without returning anything.

beep is a bit more tricky to understand. After the buffer is filled, beep will be called multiple times. Each time its excecution time is measured. Based on that a Decoder class will recreate the initial message if possible.

TLDR
beep does not return anything but should take a certain amount of time at each excecution.

Ranks are assigned during beta process by voting. That's what people have voted for.

It's one of those problems that seem trivial if you know what you're doing and impossible otherwise.