From 75512f11dca1fb586e6bc774087ccf7fb9822426 Mon Sep 17 00:00:00 2001 From: BurnhamG <18239224+BurnhamG@users.noreply.github.com> Date: Wed, 20 Feb 2019 12:10:29 -0500 Subject: [PATCH 1/4] Fix typo in problem introduction --- .../Recursion Problem 3 - Fibonacci Sequence.ipynb | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/Recursion/Recursion Interview Problems/Recursion Problems/Recursion Problem 3 - Fibonacci Sequence.ipynb b/Recursion/Recursion Interview Problems/Recursion Problems/Recursion Problem 3 - Fibonacci Sequence.ipynb index e85c24d0..8e19365c 100644 --- a/Recursion/Recursion Interview Problems/Recursion Problems/Recursion Problem 3 - Fibonacci Sequence.ipynb +++ b/Recursion/Recursion Interview Problems/Recursion Problems/Recursion Problem 3 - Fibonacci Sequence.ipynb @@ -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", From 98c641c6316a9c4619be2ae37509fc77628db77c Mon Sep 17 00:00:00 2001 From: BurnhamG <18239224+BurnhamG@users.noreply.github.com> Date: Wed, 20 Feb 2019 12:15:15 -0500 Subject: [PATCH 2/4] Fix "Fibonacci" typo --- .../Recursion Problem 3 - Fibonacci Sequence.ipynb | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Recursion/Recursion Interview Problems/Recursion Problems/Recursion Problem 3 - Fibonacci Sequence.ipynb b/Recursion/Recursion Interview Problems/Recursion Problems/Recursion Problem 3 - Fibonacci Sequence.ipynb index 8e19365c..e2575861 100644 --- a/Recursion/Recursion Interview Problems/Recursion Problems/Recursion Problem 3 - Fibonacci Sequence.ipynb +++ b/Recursion/Recursion Interview Problems/Recursion Problems/Recursion Problem 3 - Fibonacci Sequence.ipynb @@ -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", From 39f41b305ada6cf15d561aec406e6ac4227f9904 Mon Sep 17 00:00:00 2001 From: BurnhamG <18239224+BurnhamG@users.noreply.github.com> Date: Wed, 20 Feb 2019 12:16:14 -0500 Subject: [PATCH 3/4] Fix typos in problem statement --- ...cursion Problem 3 - Fibonacci Sequence - SOLUTION.ipynb | 7 +++---- 1 file changed, 3 insertions(+), 4 deletions(-) diff --git a/Recursion/Recursion Interview Problems/Recursion Problems - SOLUTIONS/Recursion Problem 3 - Fibonacci Sequence - SOLUTION.ipynb b/Recursion/Recursion Interview Problems/Recursion Problems - SOLUTIONS/Recursion Problem 3 - Fibonacci Sequence - SOLUTION.ipynb index a774e188..9294ca76 100644 --- a/Recursion/Recursion Interview Problems/Recursion Problems - SOLUTIONS/Recursion Problem 3 - Fibonacci Sequence - SOLUTION.ipynb +++ b/Recursion/Recursion Interview Problems/Recursion Problems - SOLUTIONS/Recursion Problem 3 - Fibonacci Sequence - SOLUTION.ipynb @@ -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)." ] }, { From 337f7a633c36c9bfc29b1c66318f31d7e48953a1 Mon Sep 17 00:00:00 2001 From: BurnhamG <18239224+BurnhamG@users.noreply.github.com> Date: Wed, 20 Feb 2019 12:17:53 -0500 Subject: [PATCH 4/4] Fix typos in problem statement --- .../Recursion Problem 3 - Fibonacci Sequence.ipynb | 8 +++----- 1 file changed, 3 insertions(+), 5 deletions(-) diff --git a/Recursion/Recursion Interview Problems/Recursion Problems - PRACTICE/Recursion Problem 3 - Fibonacci Sequence.ipynb b/Recursion/Recursion Interview Problems/Recursion Problems - PRACTICE/Recursion Problem 3 - Fibonacci Sequence.ipynb index 81c56493..99c1f141 100644 --- a/Recursion/Recursion Interview Problems/Recursion Problems - PRACTICE/Recursion Problem 3 - Fibonacci Sequence.ipynb +++ b/Recursion/Recursion Interview Problems/Recursion Problems - PRACTICE/Recursion Problem 3 - Fibonacci Sequence.ipynb @@ -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", @@ -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",