Typo fixed in this fork: https://www.codewars.com/kumite/6830931d9b22cae2fe115973?sel=6830931d9b22cae2fe115973

your & is composed of 7 signals, while in theory, following the binary search tree in the wiki article, there can only be 6 signals at a maximum.

sorry, i commented on this thread by error.

You can if you want to, but you do not have to. There is a preloaded table which you can use to map Mose code to a character.

I just checked the special characters and they seem to be the same as on the linked Wikipedia page. What characters exactly do you think are tested incorrectly?

In Python, sample test has the bits wrong, and not in the same format as announced by either the kata text nor as the tests of the attempt.

You have to be kidding me. Seriously? I didn't need to make the programming for which combinations of .s and -es mean which character?!

Could you specify what's the relation between patterns and special characters?, because your tests don't seem to use the characters shown in the International Morse code binary search tree as shown on the link you provided.

Okay, got another problem, when I simplify this to a bit by bit problem, I run into the 2^66 numbers problem again.
Because every matrix always give me at least a pair of rectangular matrixes, and that way lies O(2^n)

I just found out from the tests that there are 64 bit numbers involved. This should use O(cnt), else it's not possible to make it.

Is the order of the triplets (between triplets, not between letters in the triplets) intentional or could they be randomly ordered?

Python.
I think it's important to say that n is the number of vertices the polygon has.
If the above is true, then the phrasing 'For n=2, possible_triangulations(2) returns 2,' Doesn't make any sense. To return 2, n should be 4; and when n = 2, it should return 'Not a valid polygon'.

watch out for operators precedence