Given an adjacency list representing a social network of employees, find the minimum number of mutual connections (shortest path) between two employees. If no path exists, return -1.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.