From 93e57b0de5d9686c5c53ae24613ae89e082ff635 Mon Sep 17 00:00:00 2001
From: YATIN KATHURIA <47096348+Yatin-kathuria@users.noreply.github.com>
Date: Sat, 20 Nov 2021 16:21:25 +0530
Subject: [PATCH] merge: Add FibonacciNumber.js test case and update the
 decription of function. (#840)

---
 Dynamic-Programming/FibonacciNumber.js        |  9 +++++++--
 .../tests/FibonacciNumber.test.js             | 19 +++++++++++++++++++
 2 files changed, 26 insertions(+), 2 deletions(-)
 create mode 100644 Dynamic-Programming/tests/FibonacciNumber.test.js

diff --git a/Dynamic-Programming/FibonacciNumber.js b/Dynamic-Programming/FibonacciNumber.js
index c17b89427..96a3d5a34 100644
--- a/Dynamic-Programming/FibonacciNumber.js
+++ b/Dynamic-Programming/FibonacciNumber.js
@@ -1,5 +1,10 @@
-//  https://en.wikipedia.org/wiki/Fibonacci_number
-
+/**
+ * @function Fibonacci
+ * @description Fibonacci is the sum of previous two fibonacci numbers.
+ * @param {Integer} N - The input integer
+ * @return {Integer} fibonacci of N.
+ * @see [Fibonacci_Numbers](https://en.wikipedia.org/wiki/Fibonacci_number)
+ */
 const fibonacci = (N) => {
   // creating array to store values
   const memo = new Array(N + 1)
diff --git a/Dynamic-Programming/tests/FibonacciNumber.test.js b/Dynamic-Programming/tests/FibonacciNumber.test.js
new file mode 100644
index 000000000..03a89587a
--- /dev/null
+++ b/Dynamic-Programming/tests/FibonacciNumber.test.js
@@ -0,0 +1,19 @@
+import { fibonacci } from '../FibonacciNumber'
+
+describe('FibonacciNumber', () => {
+  it('fibonacci of 0', () => {
+    expect(fibonacci(0)).toBe(0)
+  })
+
+  it('fibonacci of 1', () => {
+    expect(fibonacci(1)).toBe(1)
+  })
+
+  it('fibonacci of 10', () => {
+    expect(fibonacci(10)).toBe(55)
+  })
+
+  it('fibonacci of 25', () => {
+    expect(fibonacci(25)).toBe(75025)
+  })
+})