Update readme.md

Author: gauravfs-14

solutions/ch_14_Max_Subarray_Sum/readme.md

@@ -1,4 +1,4 @@
-# Challenge 13: Find the Maximum Subarray Sum (Kadane's Algorithm)
+# Challenge 14: Find the Maximum Subarray Sum (Kadane's Algorithm)
 Write a function that takes an array as input and returns the  Maximum subarray sum. Subarrays are arrays inside another array which only contains contiguous elements.  For example, if the array is [-3, -4, 5, -1, 2, -4, 6, -1], the function should return 8 since  subarray [5, -1, 2, -4, 6] is the max sum contiguous subarray with sum 8.
 
 Write a function `MaxSubArraySum` that takes an array as its parameter and returns the maximum subarray sum. 
@@ -36,4 +36,4 @@ const arr = [-2, 3, -1, 2];
 const max = MaxSubArraySum(arr);
 console.log(max); // Output: 4
 ```
-In this example, the `MaxSubArraySum` function correctly returns the Maximum SubArray Sum of the array. 
+In this example, the `MaxSubArraySum` function correctly returns the Maximum SubArray Sum of the array.