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 > Counting Grand Tours > Editorial

Counting Grand Tours — Solution & Editorial

Back to the Problem

Bitmask DP dp[mask][u] = number of paths covering exactly 'mask' ending at u; extend to adjacent unvisited nodes. Sum over full mask and all endpoints.

Complexity: O(2N · N2)

Watch out: Counts can reach ~14! ≈ 8.7×1010 — 64-bit.