🐛 Fix: #378 Removing Redundant Condition

src/algorithms/math/fibonacci/__test__/fibonacci.test.js

@@ -12,5 +12,6 @@ describe('fibonacci', () => {
     expect(fibonacci(8)).toEqual([1, 1, 2, 3, 5, 8, 13, 21]);
     expect(fibonacci(9)).toEqual([1, 1, 2, 3, 5, 8, 13, 21, 34]);
     expect(fibonacci(10)).toEqual([1, 1, 2, 3, 5, 8, 13, 21, 34, 55]);
+    expect(() => fibonacci(-2)).toThrowError(new Error('Cannot have values less than 1'));
   });
 });

src/algorithms/math/fibonacci/__test__/fibonacciNth.test.js

@@ -21,5 +21,6 @@ describe('fibonacciNth', () => {
     expect(fibonacciNth(75)).toBe(2111485077978050);
     expect(fibonacciNth(80)).toBe(23416728348467685);
     expect(fibonacciNth(90)).toBe(2880067194370816120);
+    expect(() => fibonacciNth(-2)).toThrowError(new Error('Cannot have values less than 1'));
   });
 });

src/algorithms/math/fibonacci/fibonacci.js

@@ -10,8 +10,9 @@ export default function fibonacci(n) {
   let currentValue = 1;
   let previousValue = 0;
 
-  if (n === 1) {
-    return fibSequence;
+  // Throw error if index is not correct
+  if (n < 1) {
+    throw new Error('Cannot have values less than 1');
   }
 
   let iterationsCounter = n - 1;

src/algorithms/math/fibonacci/fibonacciNth.js

@@ -8,8 +8,9 @@ export default function fibonacciNth(n) {
   let currentValue = 1;
   let previousValue = 0;
 
-  if (n === 1) {
-    return 1;
+  // Throw error if index is not correct
+  if (n < 1) {
+    throw new Error('Cannot have values less than 1');
   }
 
   let iterationsCounter = n - 1;