- oh no! Time-limit exceeded on a 4 cases... - need to cut-down on cases where it wouldn't be possible then somehow - if we save only the max and min of the prev (k-1), rather than all products - the ...
// Given an unsorted array arr of size n that contains only non negative integers, find a sub-array (continuous elements) that has sum equal to s. You mainly need to return the left and right ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results