← Google questions
CodingReported in a candidate post, Aug 2024

Topological Sort Problem

Filed under Google · Also reported at HashedIn, Visa

Given a directed graph, perform a topological sort to return an ordering of vertices such that for every directed edge u -> v, vertex u comes before v.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.