Find the slice with the largest sum in the sequence of integers.
Open reading material (PDF)
Given a log of stock prices compute the maximum possible earning.
Difficulty Level: Easy
Find a maximum sum of a compact subsequence of array elements.
Difficulty Level: Easy
Find the maximal sum of any double slice.
Difficulty Level: Medium