Determine whether two printable-ASCII strings define a valid bijective character substitution. This coding interview problem tests consistent forward and reverse mappings, repeated characters, collisions, length mismatches, and linear-time reasoning across whitespace and punctuation.
Company: Remitly
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: Determine whether two printable-ASCII strings define a valid bijective character substitution. This coding interview problem tests consistent forward and reverse mappings, repeated characters, collisions, length mismatches, and linear-time reasoning across whitespace and punctuation.
Blind 75
75 free coding problems to build your foundations, with hints, explanations, and a progress checklist.
Data Structures & Algorithms
The patterns behind arrays, pointers, trees, graphs and dynamic programming, with worked Python examples.
Cracking the Coding Interview Companion
Our free, unofficial companion to the book: how to analyze, solve and speed up coding problems, in Python.