Isomorphic Strings

Given strings s and t, decide whether they are isomorphic. Strings are considered isomorphic if each character in s can be consistently substituted to obtain t, using a one-to-one correspondence and keeping character positions in the same order. Examples Example 1: Input: s = "paper", t = "title" Output: true Example 2: Input: s = "abca", t = "zbxz" Output: true Constraints 1 <= s.length <= 5 * 10^4 t.length == s.length Both s and t contain only valid ASCII characters.