Given the Fibonacci sequence defined by the following recursive relation,
determine the sum of squares for the first "n" terms.
For example, n=5 --> 1^2 + 1^2 + 2^2 + 3^2 + 5^2 = 40.
Additional test cases have been added.
There is a typo in the question. F_0 = 0 should be F_0 = 1 otherwise the tests will not be passed.
My solution has much higher size. Someone pls suggest edit. thanks
Hello, Dishant Varshney. Your solution is quite legitimate, and that is more important than having a small size! Some comments: 〔1〕 Your code "i = 1: length(f)" and then "f(i)" can be simplified to just "f". You do not need to provide index ranges if you want to refer to _all_ elements of an array or vector. 〔2〕 I would guess that some of the very small submissions have 'cheated' (e.g. by hard-coding solutions in a lookup table), because this Test Suite does not check for any such 'cheats'. 〔3〕 Your solution would fail for n=1, but that is also not checked in this Test Suite. Regards, DIV
Make one big string out of two smaller strings
Remove NaN ?
Return the Fibonacci Sequence
Who is the smartest MATLAB programmer?
"THAT'S WHAT SHE SAID!"
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office