The Letter Mapper

A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

medium

Seniority

L4

Problem

Given two equal-length strings s and t, return True if they are isomorphic: there exists a bijection between characters of s and t such that each s[i] maps to t[i] consistently (no two different characters map to the same character).

Summary

A consistent substitution, or not.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.