diff --git a/snippet_data/snippetList.json b/snippet_data/snippetList.json
index 5c474295b..48ab639bc 100644
--- a/snippet_data/snippetList.json
+++ b/snippet_data/snippetList.json
@@ -391,7 +391,7 @@
       "type": "snippetListing",
       "title": "fibonacci",
       "attributes": {
-        "text": "Generates an array, containing the Fibonacci sequence, up until the nth term.\n\nStarting with `0` and `1`, use `list.apoend() to add the sum of the last two numbers of the list to the end of the list, until the length of the list reaches `n`.  \nIf `n` is less or equal to `0`, return a list containing `0`.\n\n",
+        "text": "Generates an array, containing the Fibonacci sequence, up until the nth term.\n\nStarting with `0` and `1`, use `list.append() to add the sum of the last two numbers of the list to the end of the list, until the length of the list reaches `n`.  \nIf `n` is less or equal to `0`, return a list containing `0`.\n\n",
         "tags": [
           "math",
           "list",
diff --git a/snippet_data/snippets.json b/snippet_data/snippets.json
index 43bca1761..4988c4423 100644
--- a/snippet_data/snippets.json
+++ b/snippet_data/snippets.json
@@ -517,7 +517,7 @@
       "type": "snippet",
       "attributes": {
         "fileName": "fibonacci.md",
-        "text": "Generates an array, containing the Fibonacci sequence, up until the nth term.\n\nStarting with `0` and `1`, use `list.apoend() to add the sum of the last two numbers of the list to the end of the list, until the length of the list reaches `n`.  \nIf `n` is less or equal to `0`, return a list containing `0`.\n\n",
+        "text": "Generates an array, containing the Fibonacci sequence, up until the nth term.\n\nStarting with `0` and `1`, use `list.append() to add the sum of the last two numbers of the list to the end of the list, until the length of the list reaches `n`.  \nIf `n` is less or equal to `0`, return a list containing `0`.\n\n",
         "codeBlocks": {
           "code": "def fibonacci(n):\r\n  if n <= 0:\r\n    return [0]\r\n\r\n  sequence = [0, 1]\r\n  while len(sequence) <= n:\r\n    next_value = sequence[len(sequence) - 1] + sequence[len(sequence) - 2]\r\n    sequence.append(next_value)\r\n\r\n  return sequence",
           "example": "fibonacci(7) # [0, 1, 1, 2, 3, 5, 8, 13]"
diff --git a/snippets/fibonacci.md b/snippets/fibonacci.md
index 80d041b74..9b3e3e896 100644
--- a/snippets/fibonacci.md
+++ b/snippets/fibonacci.md
@@ -5,7 +5,7 @@ tags: math,list,intermediate
 
 Generates an array, containing the Fibonacci sequence, up until the nth term.
 
-Starting with `0` and `1`, use `list.apoend() to add the sum of the last two numbers of the list to the end of the list, until the length of the list reaches `n`.  
+Starting with `0` and `1`, use `list.append() to add the sum of the last two numbers of the list to the end of the list, until the length of the list reaches `n`.  
 If `n` is less or equal to `0`, return a list containing `0`.
 
 ```py