medium10 pts · first answer countsarrayskadane
Maximum subarray sum
Using Kadane's algorithm, what is the largest sum of a contiguous subarray of [-2, 1, -3, 4, -1, 2, 1, -5, 4]?
Discussion 0
Join free to post in the discussion.
Related questions
- Cost of reading arr[i]Backend Developer
- Inserting at the front of an arrayBackend Developer
- Why push is amortized O(1)Backend Developer
- Changing one character of a stringBackend Developer
- Reversing a simple stringBackend Developer
- slice vs spliceBackend Developer
- Index of the last elementBackend Developer
- indexOf and NaNBackend Developer