Longest Path in Equipment Logistics | Dataford Interview Questions

Implement a function to find the longest path in a directed acyclic graph representing equipment logistics for EquipmentShare.

Use node IDs from 0 through n - 1. The function receives a node count, directed edges, a start node, and an end node, and returns the node IDs on any longest path from start to end, or [] if the end node is unreachable. The graph is guaranteed to be acyclic.

Signature: def longest_path(n, edges, start, end):

edges is a list of [from_node, to_node] pairs. Each edge has equal weight.

Constraints

1 <= n <= 10000
0 <= len(edges) <= 20000
0 <= edges[i][0], edges[i][1] < n
The graph is directed and acyclic
start and end are valid node IDs
Each edge has equal weight

Function Signature

def longest_path(n, edges, start, end):

Your question is Longest Path in Equipment Logistics. 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