Given that 
```
f0 = '0'
f1 = '01'
f2 = '010' = f1 + f0
f3 = '01001' = f2 + f1
```

You will be given a number and your task is to return the `nth` fibonacci string. For example:

```
solve(2) = '010'
solve(3) = '01001'
```

More examples in test cases. Good luck!

If you like sequence Katas, you will enjoy this Kata: [Simple Prime Streaming](https://www.codewars.com/kata/5a908da30025e995880000e3)

Difficulty: introductory

Starter code:

def solve(n):
	

Solutions:
def solve(n):
    a,b = '01'
    for _ in range(n): a,b = a+b,a
    return a

def solve(n):
    return "0" if n == 0 else "01" if n == 1 else solve(n-1) + solve(n-2)

def solve(n):
    a, b = "0", "01"
    for i in range(0, n):
        a = b + a
        a, b = b, a
    return a
    pass

def solve(n):
    x, y = '0', '01'
    for i in range(n):
        x, y = y, y+x
    return x

def solve(n):
    if n < 1: return str(n)
    if n < 2: return solve(n-1) + str(n)
    return solve(n-1) + solve(n-2)

def solve(n,f='0',g='01'):
    return solve(n-1,g,g+f) if n else f

def solve(n):
    print(n)
    a = '0'
    b = '01'
    lf = 1
    if n > 1:
        for i in range(n-lf):
            c = b+a
            a = b
            b = c
        return c
    elif n == 1:
        return b
    else:
        return a

def solve(n):
    if n == 0:
        return "0"
    if n == 1:
        return "01"
    return f"{solve(n-1)}{solve(n-2)}"

def solve(n):
    FIB = ['0', '01']
    for _ in range(len(FIB), n+1): 
        FIB.append(FIB[-1] + FIB[-2])
    return FIB[n]

def solve(n):
    if n == 0: return '0'
    elif n == 1: return '01'
    else: return solve(n - 1) + solve(n - 2)