Group Synonyms by Connectivity | Dataford Interview Questions

Given a list of string pairs where each pair represents mutually synonymous words (aliases), return a grouped listing/mapping of all connected synonym components. For example, input: [["a", "b"], ["b", "c"], ["d", "e"]], output: {"a": ["a", "b", "c"], "d": ["d", "e"]}.

Asked in the Phone Screen stage. Coding question asked during phone screen for SDE under ASE.

Implement group_synonyms(pairs). Return a dictionary whose keys are the lexicographically smallest words in each component and whose values are lexicographically sorted component lists. Return {} for empty input.

Example: [["x", "y"], ["y", "z"]] returns { "x": ["x", "y", "z"] }.

Constraints

0 <= pairs.length <= 1000
Each pair contains exactly two non-empty strings
Each word contains at most 100 characters
Words are case-sensitive
Pairs may repeat and may contain a word paired with itself

Function Signature

def group_synonyms(pairs):

Your question is Group Synonyms by Connectivity. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem