CodingMedium-Hard
Find connected strings based on character difference and transitivity
Filed under Sabre
The question
Given N strings, find all connections among the strings where two strings are directly connected if they have the same length and differ by exactly one character. Connections also follow the transitivity rule, and the output should display the chains of words grouped by these connections.
No write-up yet. Related questions below have one.
Related Sabre questions
Collected from public candidate posts and coding forums. Updated Nov 2026.