Counting Routes in a DAG — Solution & Editorial | Jobs at Avian IT

Hiring process8 levels

1 IQ Test
2 Additional Online Test (If Required)
3 Office Interview with Hiring Manager
4 Unpaid Test Task (Motivation Check)
5 Paid Test Task and Follow-Up Interview
6 Iterative Paid Test Tasks
7 Office Verification
8 Final Interview with the Founder

Problems > Counting Routes in a DAG > Editorial

Counting Routes in a DAG — Solution & Editorial

Back to the Problem

Topologically sort, then DP: ways[v] = ∑ ways[u] over predecessors, seeded with ways[1] = 1.

Complexity: O(N + M)