LeetCode
Question
·
Apr 2022
·
New York
Uber | VO | Find longest path in graph
4 upvotes
2,056 views
3 replies
Question Details
Given a DAG, return the longest path in the graph. Input: String[][] [["NYC","SFO"], ["SFO","LAX"],["LAX","SEA"],["PDX","SEA"]] Return: List<String> NYC -> SFO -> LAX -> SEA
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Graph
Strings