205. Isomorphic Strings #

Problem Statement #

Given two strings s and t, determine if they are isomorphic.

Two strings s and t 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.

Example 1:

Input: s = "egg", t = "add"
Output: true

Example 2:

Input: s = "foo", t = "bar"
Output: false

Example 3:

Input: s = "paper", t = "title"
Output: true

Constraints:

• 1 <= s.length <= 5 * 104
• t.length == s.length
• s and t consist of any valid ascii character.

Solution: #

package main

func isIsomorphic(s string, t string) bool {
	const max = 256

	var (
		sMap [max]int
		tMap [max]int
	)

	for i := 0; i < len(s); i++ {
		sIndex := s[i] - 'a'
		tIndex := t[i] - 'a'

		if sMap[sIndex] != tMap[tIndex] {
			return false
		}

		sMap[sIndex] = i + 1
		tMap[tIndex] = i + 1
	}

	return true
}

... #