5 kyu
Compute the Largest Sum of all Contiguous Subsequences
413 of 1,160LesRamer
Description:
Given an array of numbers, calculate the largest sum of all possible blocks of consecutive elements within the array. The numbers will be a mix of positive and negative values. If all numbers of the sequence are nonnegative, the answer will be the sum of the entire array. If all numbers in the array are negative, your algorithm should return zero. Similarly, an empty array should result in a zero return from your algorithm.
largestSum([-1,-2,-3]) == 0
largestSum([]) == 0
largestSum([1,2,3]) == 6
Easy, right? This becomes a lot more interesting with a mix of positive and negative numbers:
largestSum([31,-41,59,26,-53,58,97,-93,-23,84]) == 187
The largest sum comes from elements in positions 3 through 7:
59+26+(-53)+58+97 == 187
Once your algorithm works with these, the test-cases will try your submission with increasingly larger random problem sizes.
Mathematics
Fundamentals
Algorithms
Similar Kata:
Stats:
| Created | Sep 21, 2015 |
| Published | Sep 21, 2015 |
| Warriors Trained | 2740 |
| Total Skips | 170 |
| Total Code Submissions | 4969 |
| Total Times Completed | 1160 |
| JavaScript Completions | 413 |
| C# Completions | 154 |
| Haskell Completions | 47 |
| Ruby Completions | 45 |
| Python Completions | 450 |
| F# Completions | 29 |
| Go Completions | 57 |
| Rust Completions | 44 |
| D Completions | 6 |
| Java Completions | 27 |
| Total Stars | 79 |
| % of votes with a positive feedback rating | 94% of 203 |
| Total "Very Satisfied" Votes | 181 |
| Total "Somewhat Satisfied" Votes | 19 |
| Total "Not Satisfied" Votes | 3 |
| Total Rank Assessments | 10 |
| Average Assessed Rank | 5 kyu |
| Highest Assessed Rank | 5 kyu |
| Lowest Assessed Rank | 7 kyu |
