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

Problems > Longest Path in a DAG > Editorial

Longest Path in a DAG — Solution & Editorial

Back to the Problem

Topological order DP: relax dist[v] = max(dist[u] + w) as each node is finalized. Longest path is NP-hard in general graphs but linear in a DAG.

Complexity: O(N + M)

Watch out: Weights up to 1000 over 105 edges — path weight reaches 108, safe in 64-bit.