cool

But in O notation it will be 3x vs x² i think this is still better than having nested maps or foreach.

quite clear and "understandable"

I was tempted to use the array_map(), max() and min() functions but with this solution each array is scanned 3 times. Which doesn't pose a problem, we're fine with small arrays.

Wow! never thought of using regex :<

nice

I wasn't able to place a fork for some reason, but I made this solution a bit more readable, you see it under my solution.

The only thing wrong is that the minimum tick does not occur in corner-case messages where every word is a 'T' (-), since 'T T T' --> '- - -' --> '11100000001110000000111'; but the tick (1 in this case) is recoverable.

viewing solutions is depressing....

It's curious how 14 people all have this exact same solution, down to the whitespace and the wording of the comments.

Is this brute force? What's the time complexity of this solution? Anyone?