add fibonacci exercise

Author: Mohamedali10

exercises/fibonacci/canonical-data.json

@@ -0,0 +1,51 @@
+{
+  "exercise": "fibonacci-suite",
+  "cases": [
+    {
+      "uuid": "17146bd5-2e80-4557-ab4c-05632b6b0d01",
+      "description": "Starting point 0",
+      "property": "",
+      "input": {
+        "number": 0
+      },
+      "expected": 0
+    },
+    {
+      "uuid": "5a02fd08-d336-4607-8006-246fe6fa9fb1",
+      "description": "starting point 1",
+      "property": "",
+      "input": {
+                "number": 1
+          },
+        "expected": [1]
+    },
+{
+      "uuid": "5a02fd08-d336-4607-8006-246fe6fa9fb3",
+      "description": "number 3",
+      "property": "",
+      "input": {
+                "number": 3
+          },
+        "expected": [2]
+    },
+    {
+      "uuid": "5a02fd08-d336-4607-8006-246fe6fa9fb5",
+      "description": "number 5",
+      "property": "",
+      "input": {
+                "number": 5
+          },
+        "expected": [5]
+    },
+    {
+      "uuid": "5a02fd08-d336-4607-8006-246fe6fa9fb2",
+      "description": "number 20",
+      "property": "",
+      "input": {
+                "number": 20
+          },
+        "expected": [6765]
+    }
+
+  ]
+}

exercises/fibonacci/description.md

@@ -0,0 +1,6 @@
+# Description
+
+Write a function to get the n'th Fibonacci number, The first number of the pattern is 0, the second number is 1, and each number after that is equal to adding the two numbers right before it together. 
+F0 =0, F1 =1, F2 =1, F3 = 2...
+(https://simple.wikipedia.org/wiki/Fibonacci_number)
+Hint: Think recursively!

exercises/fibonacci/metadata.toml

@@ -0,0 +1,4 @@
+title = "Fibonacci suite"
+blurb = "Fibonacci suite is based on the sum of the previos two Fibonacci numbers"
+source = "Inspired by the exercise in scala red book"
+source_url = "https://simple.wikipedia.org/wiki/Fibonacci_number"