The Fibonacci sequence F0,F1,… is a special infinite sequence of non-negative integers, where F0=0, F1=1 and for each integer n≥2, Fn=Fn−1+Fn−2. Consider the sequence D of th...
wont it be slower? recursion takes almost 5s i need to complete in 1 sec
guys can u help me optimise it? the time limit is exceeding
recursion re so ig running everytime?
can u explain this pls?