Question
Given a directed graph with n nodes (0..n-1) and a list of directed edges, return True iff it has an Eulerian path: a walk that uses every edge exactly once (not necessarily returning to the start). The conditions are: at most one vertex with out-degree - in-degree == 1 (the start) and at most one with in-degree - out-degree == 1 (the end), all others balanced, AND all edges lie in a single connected component (ignoring isolated vertices). An empty edge list returns True. Assume 1 <= n <= 10000.
has_eulerian_path_directed(n: int, edges: list[list[int]]) → bool[3,[[0,1],[1,2]]]outtrueState your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.