Find Eventual Safe States

Medium Topological Sort & DAG

A node is safe if every path starting from it leads to a terminal node (one with no outgoing edges). Print all safe nodes in ascending order.

Constraints

1 <= n <= 10^4

No discussions yet.