โ† Societe Generale questions

Unique Nodes within 2 Hops in Undirected Graph

Filed under Societe Generale

The question

Given an undirected graph and a starting node, find all possible unique nodes that can be visited within a maximum of 2 hops.

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

Related Societe Generale questions

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