Mr.Obvious :D

issue fixed

this solution forced me to question myself "How I got at 3kyu" 😶

Awesome! I wasted a lot of memory on storing numbers :(

gap yo'q

Your solution does not solve the problem. It's not just about counting the characters, it's also about checking if the corresponding characters are in the same locations thorough the string. In your example, the strings are not isomorphic because one string cannot be turned into the other by changing every occurrence of one letter to another letter:

a = "ABCBACCBA"
      |     |<---- Strings are not isomorphic, because B is paired with B in one place, and with A in another place. 
b = "ABCBACCAB"

Failed test with a = "ABCBACCBA" and b = "ABCBACCAB": True should equal False
Expected True

ahh, I see it now! Thanks

Those two strings are not isomorphic, you cannot get from one to the other with a 1:1 substitution cipher.

Either i'm missing something or this kata has a bug. I am passing all but 9 tests.

This example is failing: 'a: ABCBACCBA b: ABCBACCAB'. (1 1 1 1 1 2 1 1)

The patterns and length match up perfectly here so im returning true, but it's expecting false? I've been racking my brain over this for a while now and re-reading the instructions. I cannot figure out how this is expected to be false. Any advise?

Scala translation

your fork has been approved

Because each string can be mapped 1:1 with the other string

zhaev
replace z -> i
ihaev
replace h -> k
ikaev
replace a -> f
ikfev
replace e -> d
ikfdv
replace v -> p
ikfdp

zhaev ikfdp whhyyyyy it`s true .......

on casual inspection this no longer seems to be the case