upd: 3 kyu

4 kyu

The trick of the memoized version is that we will keep a cache data structure

...into a recursive Fibonacci function(there is no need in ecursion at point we have a previous values)

first cite means we got a previous values

second cite means it is still advisable to use recursion, but why?

mein gott...

kinda bad practice :/