Code Room
CodingHard
Question
Given the adjacency matrix 'adj' of a directed graph on n nodes (adj[u][v] == 1 means there is an edge u -> v), count the number of distinct Hamiltonian paths that start at node 0 and visit every node exactly once. Return the count. 1 <= n <= 14. A single node trivially has one path.
Implement
hamiltonian_path_count(adj: list[list[int]]) → intExamples
in
[[[0,1,1],[1,0,1],[1,1,0]]]out2What 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.