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 > The N-th Term of a Recurrence > Editorial

The N-th Term of a Recurrence — Solution & Editorial

Back to the Problem

Build the K×K companion matrix of the recurrence and raise it to the appropriate power; multiply by the initial state vector. For N < K just print the given value.

Complexity: O(K3 log N)

Watch out: Index the state vector consistently (newest-first vs oldest-first) — the single most common bug.