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.

Loading…