Problem 1946. Fibonacci-Sum of Squares

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