Understanding isomorphic strings algorithm

Question

I am understanding the following code to find if the strings are isomorphic or not. The code uses two hashes s_dict and t_dict respectively. I am assum

Answer 1

One simple example, your code doesn't work on s='ab',t='aa'.

Basically you have to have both way to be isomorphic. Your code only checked that t can be modified from s, but not the other way around.