Exercise from the CodeWars

Fibonacci Strings

def solve(n):
    f0, f1 = "0", "01"
    if n == 0:
        return f0
    elif n == 1:
        return f1
    elif n > 1:
        for i in range(2, n + 1):
            b = f0
            f0 = f1
            f1 = b + f0
        return f1


print((solve(0), '0'))
print((solve(3), '01001'))
print((solve(5), '0100101001001'))