How Many Shortest Routes — 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 > How Many Shortest Routes > Editorial

How Many Shortest Routes — Solution & Editorial

Back to the Problem

BFS layering plus path counting: reaching v at dist(u)+1 inherits ways(u); reaching it again on the same layer adds ways(u).

Complexity: O(N + M)