Given an array of integers, the goal is to efficiently find the subarray that has the greatest value when all of its elements are summed together.
-
Notifications
You must be signed in to change notification settings - Fork 0
Find the sub-array that has the greatest value when all of its elements are summed together.
License
lucasrepo/Maximum-subarray-sum
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Find the sub-array that has the greatest value when all of its elements are summed together.