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 2050. Parallel Courses III

Given a DAG of course prerequisites where each course has a duration and any number of courses can run in parallel once prerequisites are satisfied, compute the minimum time to finish all courses. This is the classic longest-path/critical-path problem on a node-weighted DAG — compute each course's earliest completion time as max(completion times of prerequisites) + its duration.

Asked at:

Google

Question Timeline

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

Company

Level

Region

Late May, 2025

Salesforce

Staff

Mid February, 2025

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 2050. Parallel Courses III

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact