@@ -18,10 +18,10 @@ export default function dpMaximumSubarray(inputArray) {
1818let currentSum = 0 ;
1919
2020// We need to keep track of the starting and ending indices that contributed to our maxSum
21- // so that we can return the actual subarray.
21+ // so that we can return the actual subarray. From the beginning let's assume that whole array
22+ // is contributing to maxSum.
2223let maxStartIndex = 0 ;
23- let maxEndIndex = inputArray . length ;
24-
24+ let maxEndIndex = inputArray . length - 1 ;
2525let currentStartIndex = 0 ;
2626
2727inputArray . forEach ( ( currentNumber , currentIndex ) => {
@@ -31,7 +31,7 @@ export default function dpMaximumSubarray(inputArray) {
3131if ( maxSum < currentSum ) {
3232maxSum = currentSum ;
3333maxStartIndex = currentStartIndex ;
34- maxEndIndex = currentIndex + 1 ;
34+ maxEndIndex = currentIndex ;
3535}
3636
3737// Reset currentSum and currentStartIndex if currentSum drops below 0.
@@ -41,5 +41,5 @@ export default function dpMaximumSubarray(inputArray) {
4141}
4242} ) ;
4343
44- return inputArray . slice ( maxStartIndex , maxEndIndex ) ;
44+ return inputArray . slice ( maxStartIndex , maxEndIndex + 1 ) ;
4545}