Find Complexity

CodeChefOpen on judge ↗

Riya loves to find the complexity of algorithms . Today, she found a very interesting algorithm whose complexity is difficult to find. $ T(n) = \begin{cases} 2 & \quad \text{if } n = 1\\ 49 & \quad \text{if } n = 2\\ 7*( 2*T(n-1) - 7*T(n-2) ) &\quad \text{if } n \geq 3\\ \end{cases} $ Please help Riya to find the complexity. As the answer can be very large out

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI