New
ML System Design & SQL tracks just landed
See what's new
×
Question Bank
Pricing
Blog
Forum
HOT
JobRadar
NEW
Referral
Description
Solution
Discussion
Submissions
Ask AI
Question Bank
Meta
Coding Question
AI Insights
Quick Summary
Determine if each word in a list maintains a strict one-to-one character mapping with a given pattern.
Valid matches require identical string lengths and consistent bidirectional character associations.
Return a list of booleans indicating whether each word successfully matches the pattern.
What This Tests
Bidirectional hash mapping for bijection validation
Simultaneous iteration over two sequences
Handling edge cases like length mismatches
Optimizing space complexity with fixed-size alphabets
Common Patterns
Hashing
Collapse
Hint 1
Hint 2
What Interviewers May Ask Next
Ask AI Assistant
Ask AI Assistant
Ask me anything about this coding question!
Qwen
Qwen3.6-Flash
0/2000
Auto
Debug
Run
Submit
Test Cases
Input
Output
Expected
