Skip to main content
Minimum Size Subarray Sum | AlgoCracked
AlgoCracked
ProblemsMinimum Size Subarray Sum
Medium45.0% acceptance
ArrayBinary SearchSliding WindowPrefix Sum

Minimum Size Subarray Sum

Given an array of positive integers nums and a positive integer target , return the minimal length of a contiguous subarray whose sum is at least target . If no such subarray exists, return 0 . Input format Input is [target, nums] , e.g. [7,[2,3,1,2,4,3]] .

Loading workspace…