tvl-depot/scratch/facebook/interview-cake
William Carroll 417d3b5fff Implement a bottom-up fibonacci
The bottom-up solution run in O(n) time instead of O(2^n) time, which the
recursive solution runs as:

```
def fib(n):
    return fib(n - 2) + fib(n - 1)
```

Remember that exponential algorithms are usually recursive algorithms with
multiple sibling calls to itself.
2020-11-21 14:48:12 +00:00
..
bst-checker.py Reimplement bst-checker 2020-11-21 14:21:05 +00:00
linked-list-cycles.py Solve "linked-list-cycles" 2020-11-21 14:47:18 +00:00
merge-sorted-arrays.py Solve merge-sorted-arrays (again) 2020-11-21 13:41:33 +00:00
nth-fibonacci.py Implement a bottom-up fibonacci 2020-11-21 14:48:12 +00:00