Given that
- f0 = '0'
- f1 = '01'
- f2 = '010' = f1 + f0
- f3 = '01001' = f2 + f1
Will be given a number and task is to return the nth fibonacci string. For example:
- solve(2) = '010'
- solve(3) = '01001'
Source: https://www.codewars.com/kata/simple-fibonacci-strings