Quick Overview

This question evaluates graph theory and scheduling competencies, including dependency resolution, cycle detection in directed graphs, and capacity-constrained task scheduling based on prerequisites.

Compute minimum semesters to finish courses

Company: Netflix

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Quick Answer: This question evaluates graph theory and scheduling competencies, including dependency resolution, cycle detection in directed graphs, and capacity-constrained task scheduling based on prerequisites.

Loading…