Welcome back!
or
See if your code passes the tests for free.
Save your work and track your progress
Master data structures and algorithms
Become confident in coding interviews
or
Unlock all solutionsPro12 month access
 
Pay only once. No subscriptions.
Master data structures and algorithms
Learn essential patterns
Become confident in coding interviews
Start the free course
Save your work and track your progress
See if your code passes the tests for free
Master data structures and algorithms
or
Stack Bash - Master data structures and algorithms
CourseAboutUpgrade
Algorithm Analysis
Big O
Primitives
Bitwise operators
Swap bits
Power of two
Count bits
Reverse bits
Find duplicate
Bitwise addition
Arrays
Array
Trade stock once
Addition
Find the smallest
Sort colors
Reorganize numbers
Maximum subarray
Container of water
Strings
Strings
Reverse String
Anagram
Reverse words
String match
Compression
One edit away
Linked Lists
Linked List
Insert Node
Remove Node
Find the Middle
Add Linked Lists
Reverse Linked List
Detect Cycle
Merge Linked Lists
Pivot Linked List
Hash Tables
Hash Table
Two sum
Palindrome Check
Cover Set
Missing number
Crypto Exchange
Distinct Subarray
Stacks & Queues
Stack
Queue
Implement Stack
Implement Queue
Valid stack sequence
Max Stack
Valid Parentheses
Simplify Path
Trees & Graphs
Binary Tree
Graph
Breadth first search
Depth first search
Inorder Traversal
Tree Sum
Tree Height
LCA
Max Path Sum
Search maze
Number of islands
Heap
Kth Smallest
Sort K Arrays
Sorting & Searching
Binary search
Merge sort
Quick sort
Implement binary search
Merge intervals
Kth largest in array
Intersection of Arrays
Search sorted matrix
Search row & col sorted matrix
Recursion & Dynamic Programming
Recursion
Fibonacci
Unique paths
Knapsack
Subset sum
Power set
Coin change
Word break
Longest common subsequence

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

7 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.Sort colorsMedium
  5. 5.Reorganize numbersHard
  6. 6.Maximum subarrayHard
  7. 7.Container of waterHard
Previous LessonReorganize numbersNext LessonContainer of water