Quick Overview

This question evaluates understanding of graph algorithms—particularly topological sorting and cycle detection—and competency in ordering dependencies in directed acyclic graphs.

Return a topological ordering of a graph

Company: Microsoft

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: hard

Interview Round: Technical Screen

Overview: This question evaluates understanding of graph algorithms—particularly topological sorting and cycle detection—and competency in ordering dependencies in directed acyclic graphs.

Read the full Microsoft Software Engineer interview experience this question came from

Loading…