Medium DSA Question on String Mapping

Problem: A medium-difficulty DSA question involving string mapping (e.g. determining if two strings follow a consistent character/pattern mapping). Constraints: Typical string-length/character-set constraints for a medium LeetCode-style problem. Approach: Use a hashmap to track a bijective mapping between characters/tokens of the two strings, verifying consistency as you scan both strings in parallel; reject if any character maps to two different counterparts.