Fibonacci in O(n) time

#1

question–>
https://practice.geeksforgeeks.org/problems/print-first-n-fibonacci-numbers1002/1#
code->

#2

Hey @sheikhhaji18
Just initialize size of dp array to n because u are using dp[i] later directly which does not exist hence segmentation

  vector<long long> dp(n);
#3

thanks @Kartikkhariwal1

1 Like
#4

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.