Empresa engajada
Given array, find biggest sum of n=3 any subarray. Given array (can be negative), find biggest sub array with biggest sum.
Sigiloso
Go find combinations in real time (sic!), go find sum, optimize, guess complexity (aha, combinations different lengths)