Code Room
CodingMedium
Question
Given a directed acyclic graph as an adjacency list (graph[i] lists nodes reachable directly from node i), return all paths from node 0 to node n-1, where n = len(graph). Each path is the ordered list of node indices; return the overall list sorted. The graph has at most 8 nodes.
Implement
all_dag_paths(graph: list[list[int]]) → list[list[int]]Examples
in
[[[1,2],[3],[3],[]]]out[[0,1,3],[0,2,3]]What 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.
Learn the concepts
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.
Run or narrate your approach, then ask the coach.