Longest Subarray With Sum ≤ K

Question

Classic two-pointer / sliding-window: given an array of non-negative integers and a bound K, return the length of the longest contiguous subarray whose sum does not exceed K.

Goldman Sachs interview candidates · Answer

Community-reported Goldman Sachs interview question with 1 related discussion. The full write-up and related discussions are available to members.

Comments