René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/minimum-size-subarray-sum","name":"#209 - Minimum Size Subarray Sum - LeetCode JavaScript Solutions","description":"Given an array of positive integers nums and a positive integer target, return the minimal length of a subarray whose sum is greater than or...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number} target\n * @param {number[]} nums\n * @return {number}\n */\nvar minSubArrayLen = function(target, nums) {\n  let result = Infinity;\n\n  for (let right = 0, sum = 0, left = 0; right < nums.length; right++) {\n    sum += nums[right];\n    while (sum >= target) {\n      result = Math.min(result, right - left + 1);\n      sum -= nums[left];\n      left++;\n    }\n  }\n\n  return result === Infinity ? 0 : result;\n};","keywords":"LeetCode 209, #209 - Minimum Size Subarray Sum, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}