diff --git a/Dynamic-Programming/KadaneAlgo.js b/Dynamic-Programming/KadaneAlgo.js
index f5b8c937a..e436b6edd 100644
--- a/Dynamic-Programming/KadaneAlgo.js
+++ b/Dynamic-Programming/KadaneAlgo.js
@@ -9,7 +9,7 @@
  * Reference article :- https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/
  */
 
-function kadaneAlgo (array) {
+export function kadaneAlgo (array) {
   let cummulativeSum = 0
   let maxSum = Number.NEGATIVE_INFINITY // maxSum has the least posible value
   for (let i = 0; i < array.length; i++) {
@@ -23,4 +23,3 @@ function kadaneAlgo (array) {
   return maxSum
   // This function returns largest sum contiguous sum in a array
 }
-export { kadaneAlgo }
diff --git a/Dynamic-Programming/tests/KadaneAlgo.test.js b/Dynamic-Programming/tests/KadaneAlgo.test.js
index 3155e6e82..c1f883113 100644
--- a/Dynamic-Programming/tests/KadaneAlgo.test.js
+++ b/Dynamic-Programming/tests/KadaneAlgo.test.js
@@ -1,8 +1,8 @@
 import { kadaneAlgo } from '../KadaneAlgo'
 test('it is being checked that 15 is the answer to the corresponding array input', () => {
-  expect(fc.kadaneAlgo([1, 2, 3, 4, 5])).toBe(15)
+  expect(kadaneAlgo([1, 2, 3, 4, 5])).toBe(15)
 })
 
 test('it is being checked that 5 is the answer to the corresponding array input', () => {
-  expect(fc.kadaneAlgo([-1, -2, -3, -4, 5])).toBe(5)
+  expect(kadaneAlgo([-1, -2, -3, -4, 5])).toBe(5)
 })