jeena/en.javascript.info
1
0
Fork 0
Code Issues Pull requests Projects Packages Wiki Activity Actions

a tiny correction

Browse source 
I guess 'find return' looks a bit awkward, maybe you wanted to write 'find and return' but dropped 'and'. Just 'return' seems fine.
PS. I don't believe that I didn't solve the simple task yet. Few years ago I was able to handle much more complex stuff ... feelsWierdAndBadMan.
This commit is contained in:
daGo 2018-10-17 20:14:31 +03:00 • committed by GitHub
parent 4c103dc698
commit 6a718598f3
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

4
1-js/05-data-types/04-array/10-maximal-subarray/task.md
View file

@ -8,7 +8,7 @@ The input is an array of numbers, e.g. `arr = [1, -2, 3, 4, -9, 6]`.
The task is: find the contiguous subarray of `arr` with the maximal sum of items.
Write the function `getMaxSubSum(arr)` that will find return that sum.
Write the function `getMaxSubSum(arr)` that will return that sum.
For instance:
@ -27,4 +27,4 @@ If all items are negative, it means that we take none (the subarray is empty), s
getMaxSubSum([-1, -2, -3]) = 0
```
Please try to think of a fast solution: [O(n<sup>2</sup>)](https://en.wikipedia.org/wiki/Big_O_notation) or even O(n) if you can.
Please try to think of a fast solution: [O(n<sup>2</sup>)](https://en.wikipedia.org/wiki/Big_O_notation) or even O(n) if you can.