205. Isomorphic Strings | Hash Map | Strings 

i think, this is the most intuitive and brute force approach from any other approach

Brute force is to loop t for every unique character of s and check for violations. It will be O(n^2)