Leetcodify Friends Recommendations

Given a large social graph, compute for each user the top-k recommended new friends (excluding existing connections) ranked by mutual-friend or interaction-based score; the challenge is to efficiently count and rank candidate neighbors at scale using graph traversal, neighbor intersection/counting, and optimized top-k selection under tight time/memory constraints.