Longest Chain of Linked Names in a Directed Acyclic Graph
Company: Oscar
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: hard
Interview Round: Technical Screen
Overview: A graph coding question: given directed pairs of names that together form an acyclic graph, return the number of names in the longest chain that follows the pairs in order. It tests building an adjacency structure from string pairs and computing the longest path in a directed acyclic graph efficiently on large inputs.