Skip to content

Fibonacci Typo Fixes #14

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 5 commits into
base: master
Choose a base branch
from
Open

Fibonacci Typo Fixes #14

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
75512f1
Fix typo in problem introduction
BurnhamG Feb 20, 2019
98c641c
Fix "Fibonacci" typo
BurnhamG Feb 20, 2019
39f41b3
Fix typos in problem statement
BurnhamG Feb 20, 2019
337f7a6
Fix typos in problem statement
BurnhamG Feb 20, 2019
53b8221
Merge branch 'upstream/master', resolving conflict
BurnhamG Dec 10, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 3 additions & 4 deletions ...Recursion Interview Problems/03-Fibonacci-Sequence/03-Fibonacci Sequence - SOLUTION.ipynb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,19 +6,18 @@
"collapsed": true
},
"source": [
"# Fibonnaci Sequence\n",
"# Fibonacci Sequence\n",
"\n",
"## Problem Statement\n",
"\n",
"Implement a [Fibonnaci Sequence](https://en.wikipedia.org/wiki/Fibonacci_number) in three different ways:\n",
"Implement a [Fibonacci Sequence](https://en.wikipedia.org/wiki/Fibonacci_number) in three different ways:\n",
"\n",
"* Recursively\n",
"* Dynamically (Using Memoization to store results)\n",
"* Iteratively\n",
"\n",
"Remember that a fibonacci sequence: 0,1,1,2,3,5,8,13,21,... starts off with a base case checking to see if n = 0 or 1, then it returns 1. \n",
"Remember that a Fibonacci sequence: 0,1,1,2,3,5,8,13,21,... starts off with a base case checking to see if n = 0 or n = 1. If so, it returns n, otherwise it returns fib(n-1) + fib(n-2).",
"\n",
"Else it returns fib(n-1)+fib(n+2)."
]
},
{
Expand Down
8 changes: 3 additions & 5 deletions 05-Recursion/Recursion Interview Problems/03-Fibonacci-Sequence/03-Fibonacci Sequence.ipynb
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,13 +6,13 @@
"collapsed": true
},
"source": [
"# Fibonnaci Sequence\n",
"# Fibonacci Sequence\n",
"\n",
"In this interview excercise we will begin to get a feel of having to solve a single problem multiple ways!\n",
"\n",
"## Problem Statement\n",
"\n",
"Implement a [Fibonnaci Sequence](https://en.wikipedia.org/wiki/Fibonacci_number) in three different ways:\n",
"Implement a [Fibonacci Sequence](https://en.wikipedia.org/wiki/Fibonacci_number) in three different ways:\n",
"\n",
"* Recursively\n",
"* Dynamically (Using Memoization to store results)\n",
Expand All @@ -21,9 +21,7 @@
"#### Function Output\n",
"Your function will accept a number **n** and return the **nth** number of the fibonacci sequence\n",
"___\n",
"Remember that a fibonacci sequence: 0,1,1,2,3,5,8,13,21,... starts off with a base case checking to see if n = 0 or 1, then it returns 1. \n",
"\n",
"Else it returns fib(n-1)+fib(n+2).\n",
"Remember that a Fibonacci sequence: 0,1,1,2,3,5,8,13,21,... starts off with a base case checking to see if n = 0 or n = 1. If so, it returns n, otherwise it returns fib(n-1) + fib(n-2).",
"\n",
"____\n",
"\n",
Expand Down