Can you elaborate how we got time complexity to be O(N)?

#1

With regards to fibonacci using dp

#2

we are calculating by maintaining a dp array of size n and traversing over it once… hence O(N)

#3

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.