Longest subarray with sum ≤ k (non-negative values).
Type it from memory — say each line out loud as you write it. Then check.
Longest subarray with sum ≤ k (non-negative values).
Type it from memory — say each line out loud as you write it. Then check.