René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/continuous-subarray-sum","name":"#523 - Continuous Subarray Sum - LeetCode JavaScript Solutions","description":"Given an integer array nums and an integer k, return true if nums has a good subarray or false otherwise. A good subarray is a subarray wher...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @param {number} k\n * @return {boolean}\n */\nvar checkSubarraySum = function(nums, k) {\n  const map = new Map([[0, -1]]);\n\n  for (let i = 0, sum = 0; i < nums.length; i++) {\n    sum += nums[i];\n    if (k !== 0) {\n      sum = sum % k;\n    }\n\n    if (map.has(sum)) {\n      if (i - map.get(sum) >= 2) {\n        return true;\n      }\n    } else {\n      map.set(sum, i);\n    }\n  }\n\n  return false;\n};","keywords":"LeetCode 523, #523 - Continuous Subarray Sum, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}