Recognizing the Right Core Pattern

Learn to match problem constraints to two-pointers, sliding window, BFS/DFS, or dynamic programming.

You must find the length of the longest contiguous subarray whose sum is at most K, where the array contains only positive integers. Which core pattern most directly and efficiently solves this in O(n)?