Stack Bash - Master data structures and algorithms

Maximum subarray

Hard
Given an array of integers, find the maximum sum of any subarray within the array.
Some examples:
  1. max_sum([1, 9, 2]) returns 12 from the subarray [1, 9, 2]
  2. max_sum([-2, 5, -1, 4]) returns 8 from the subarray [5, -1, 4]
  3. max_sum([-1, 3, -2]) returns 3 from the subarray [3]
Note that a subarray implies that the numbers must be contiguous in the array.

Solution

6 Essential Arrays Coding Interview Problems

Master Arrays by trying the coding challenges below.
  1. 1.Trade stock onceEasy
  2. 2.AdditionEasy
  3. 3.Find the smallestEasy
  4. 4.Reorganize numbersHard
  5. 5.Maximum subarrayHard
  6. 6.Container of waterHard
Previous Lesson
Reorganize numbers
Next Lesson
Container of water

Want to confidently pass your next coding interview?

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.