Graph-Based Neighbor Discovery | Dataford Interview Questions

Tell me how you would find and rank nearby hosts for Neighbor using graph-based neighbor discovery and related algorithms.

Implement rank_nearby_hosts(graph, start, host_scores, k). graph maps each node ID to adjacent node IDs, and host_scores maps host IDs to numeric scores. Return up to k reachable hosts, excluding start, ordered by shortest graph distance, highest score, then lexicographically smallest host ID.

Constraints

1 <= number of graph nodes <= 1000
0 <= number of graph edges <= 5000
0 <= len(host_scores) <= 1000
Host IDs are unique strings
All host scores are integers
The graph is unweighted and may be disconnected
Return at most k hosts

Function Signature

def rank_nearby_hosts(graph, start, host_scores, k):

Your question is Graph-Based Neighbor Discovery. 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

Tell me how you would find and rank nearby hosts for Neighbor using graph-based neighbor discovery and related algorithms.

Constraints

1 <= number of graph nodes <= 1000
0 <= number of graph edges <= 5000
0 <= len(host_scores) <= 1000
Host IDs are unique strings
All host scores are integers
The graph is unweighted and may be disconnected
Return at most k hosts

Function Signature

def rank_nearby_hosts(graph, start, host_scores, k):

Your question is Graph-Based Neighbor Discovery. 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.