Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1257. Smallest Common Region
Given lists where each entry names a parent region followed by its immediate subregions and two region names, find their smallest common region — the lowest common ancestor in that region hierarchy. This is essentially an LCA-on-strings problem on a rooted tree defined by parent→children relationships.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.