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 > Matrix Chain Multiplication > Editorial

Matrix Chain Multiplication — Solution & Editorial

Back to the Problem

Interval DP: dp[i][j] = cheapest way to multiply matrices i..j, splitting at every k. O(N³).

Complexity: O(N3)

Watch out: Costs reach ~106·N ≈ 109 — 64-bit.