The Letter Mapper
A medium Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- medium
- Seniority
- L4
Interview Prompt
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.
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision