Leetcode 1153. String Transforms Into Another String

Given two equal-length strings s and t, determine whether s can be converted into t by repeatedly replacing all occurrences of one character in s with another character; mappings must be consistent, and cycles in the character-mapping graph require at least one unused character (e.g., from the alphabet) to break.