Eulerian path existence
Given an undirected graph with n nodes (0..n-1) and edges [u, v], determine whether an Eulerian path exists: a walk that uses every edge exactly once. Return True or False. Isolated nodes (degree 0) are ignored for connectivity; a graph with no edges trivially has one. Constraints: 1 <= n <= 2000; parallel edges allowed.
Implement
has_eulerian_path_undirected(n: int, edges: list[list[int]]) → boolExamples
in
[3,[[0,1],[1,2]]]outtrueWhat a strong answer looks like
State 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.
0:00 of about 25 min
solution.py
InputExpectedGot
[3,[[0,1],[1,2]]]truenot run yetsample