please explain the question and how to approach it using the recurrence relation
SPP- recursive sequence
Hey @kunalsaini8950
This question is based on fast exponentiation. Let’s say your current k elements are X and your k input coefficients are Y. Then X*Y givens X+1th K elements. For better idea see fast fibonacci.
If your doubt is resolved please mark it as closed.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.