Computing a recurrence in O(log n) with a transition matrix
How can you compute the same third-order recurrence for a large n faster than O(n)?
Answer as you would in an interview
Answer aloud or write down a few key points. The text field is optional; the review opens after your attempt.