If all of the cards' values belonging to any one suit in one string correspond to all of the cards' values of any one suit in the other string, there is 1:1 mapping. If that is true for all suits appearing in either string, without re-using cards in more than 1 mapping, then return true. This implies that the strings have equal counts (0 <= n <= 4) of cards having the same value, and thus the strings have the same total number of cards and thus the same length. The "hand" isn't scored or ranked.

I don't understand what i'm supposed to do with the suits. I don't understand how are some not isomorphic and some are. The hand rank does not change

test the encode function ot have an idea of what is going on
the test already written give hug hints !
you can also add some tests on your own.
What do you observe with aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa ?
what about bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb ?

Traceback (most recent call last):
File "tests.py", line 2, in
from solution import yoda_talk
ImportError: cannot import name 'yoda_talk' from 'solution' (/workspace/default/solution.py)

what the hell is happening in that list comprehension? How is the range(a,b) constructed if a,b are defined in a child loop?