Compute Minimum Task Completion Time

Quick Overview

This question evaluates understanding of graph algorithms (topological sort and DFS), dependency scheduling, cycle detection, and critical-path computation for tasks with durations.

Compute Minimum Task Completion Time

Company: Netflix

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: This question evaluates understanding of graph algorithms (topological sort and DFS), dependency scheduling, cycle detection, and critical-path computation for tasks with durations.

|Home/Coding & Algorithms/Netflix
Netflix logo
Netflix
May 30, 2026
mediumSoftware EngineerTechnical ScreenCoding & Algorithms
5
0
Loading...

Submit Your Answer to Earn 20XP

Sign in to leave a comment

Loading comments...