← Back
00:00

DAG Order Validator

Citadel interview questions · Medium · Coding round · 6 tests

Given a directed acyclic graph and a proposed ordering of its nodes, determine whether the ordering is a valid topological sort.

Interface

isValidDagOrder(
  nodeCount: number,
  edges: Array<[number, number]>,
  order: number[],
): boolean
Idle