GoLang Solution For LeetCode Problem: Isomorphic Strings
Given two strings s and t, determine if they are isomorphic.
Two strings are isomorphic if the characters in s can be replaced to get t.
All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character but a character may map to itself.
Input: s = "egg", t = "add" Output: true
Input: s = "foo", t = "bar" Output: false
Input: s = "paper", t = "title" Output: true
You may assume both s and t have the same length.
See the full details of the problem Isomorphic Strings at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go