Given a social graph represented as adjacency lists or iterator interfaces, find the connection depth (shortest path distance) between two given users, optimizing the algorithm to use O(1) auxiliary…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.