NeetCode #238LC-209MediumSliding WindowNC 250
← Back to All Problems#238 · #209 · Minimum Size Subarray Sum(长度最小的子数组)
📌 Problem Statement & Constraints
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 none exists, return 0. Constraints: 1 <= nums.length <= 10^5, 1 <= nums[i] <= 10^4, 1 <= target <= 10^9.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!