Parallel Courses III: coding question

Available question text

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.

Continue with questions that share topics or the same question type.

Alien Dictionary
Coding · Array · Breadth-First Search · Depth-First Search
Find All Possible Recipes from Given Supplies
Coding · Array · Directed Acyclic Graph · Graph Theory
Loud and Rich
Coding · Array · Depth-First Search · Directed Acyclic Graph
Course Schedule
Coding · Breadth-First Search · Depth-First Search · Directed Acyclic Graph

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 5 records

Google
Leetcode 2050. Parallel Courses III
Reported Nov 27, 2024 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View source
Meta
Leetcode 2050. Parallel Courses III
Reported Feb 18, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
Modular
Leetcode 2050. Parallel Courses III
Reported Oct 6, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
Salesforce
Leetcode 2050. Parallel Courses III
Reported May 28, 2025 · 1 source report
STAFF
Source snapshot: Nov 12, 2026
View source

Available question text

Parallel Courses III

Available question text

Related questions

Parallel Courses III

Available question text

Related questions