Merge pull request #9 from kennarddh/feat/NthNumberFibonacci

feat(L-B): 0006 NthNumberFibonacci ( L-B )

Author: devvsakib

L-B/0006 NthNumberFibonacci ( L-B )/NthNumberFibonacci.js

@@ -0,0 +1,8 @@
+const NthNumberFibonacci = n => {
+	if (n <= 0) return 0
+	if (n <= 1) return 1
+
+	return NthNumberFibonacci(n - 2) + NthNumberFibonacci(n - 1)
+}
+
+module.exports = NthNumberFibonacci

L-B/0006 NthNumberFibonacci ( L-B )/README.md

@@ -0,0 +1,44 @@
+# 0006 NthNumberFibonacci ( L-B )
+
+## Problem
+
+Create a function that return the nth fibonacci number.
+
+Fibonacci starts with `0` and `1`
+
+Fibonacci(n) = Fibonacci(n - 1) + Fibonacci(n - 2)
+
+## Test Cases
+
+-   NthNumberFibonacci(10) // 55
+-   NthNumberFibonacci(6) // 8
+-   NthNumberFibonacci(0) // 0
+-   NthNumberFibonacci(1) // 1
+-   NthNumberFibonacci(2) // 1
+-   NthNumberFibonacci(3) // 2
+
+## Solution
+
+```javascript
+const NthNumberFibonacci = n => {
+	if (n <= 0) return 0
+	if (n <= 1) return 1
+
+	return NthNumberFibonacci(n - 2) + NthNumberFibonacci(n - 1)
+}
+```
+
+## References
+
+-   [Wikipedia](https://en.wikipedia.org/wiki/Fibonacci_number)
+-   [Recursive MDN](https://developer.mozilla.org/en-US/docs/Glossary/Recursion)
+
+## Problem Added By
+
+-   [GitHub](https://www.github.com/kennarddh)
+
+## Contributing
+
+Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.
+
+Please make sure to update tests as appropriate.

L-B/0006 NthNumberFibonacci ( L-B )/Test.js

@@ -0,0 +1,12 @@
+const { strict: assert } = require('assert')
+
+const NthNumberFibonacci = require('./NthNumberFibonacci.js')
+
+assert.equal(NthNumberFibonacci(10), 55)
+assert.equal(NthNumberFibonacci(6), 8)
+assert.equal(NthNumberFibonacci(0), 0)
+assert.equal(NthNumberFibonacci(1), 1)
+assert.equal(NthNumberFibonacci(2), 1)
+assert.equal(NthNumberFibonacci(3), 2)
+
+console.log('All tests success')