โ† Sabre questions

Count Neighbors within 2 Edges and Group Transitive Strings

Filed under Sabre

The question

Count the number of neighbors at a maximum of 2 edge distances in an unweighted bidirectional graph. Given multiple strings where two strings have a relationship if they are of the same size and differ by 1 character, group the strings that follow the transitive property.

No write-up yet. Related questions below have one.

Related Sabre questions

Collected from public candidate posts and coding forums. Updated Nov 2026.