30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 2192. All Ancestors of a Node in a Directed Acyclic Graph

Given a DAG with n nodes and directed edges, compute for each node the sorted list of all nodes that can reach it (its ancestors). This is essentially computing the transitive closure/reachability for every node, leveraging the DAG/topological ordering to do it efficiently within the n ≤ 1000 constraint.

Asked at:

Amazon

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid October, 2024

Amazon

Mid-level

Find the number of ancestors of a person and list ancestors from oldest to newest

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2192. All Ancestors of a Node in a Directed Acyclic Graph

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact