René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/split-array-with-equal-sum","name":"#548 - Split Array with Equal Sum - LeetCode JavaScript Solutions","description":"Given an integer array nums of length n, return true if there is a triplet (i, j, k) which satisfies the following conditions:  0 < i, i ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {boolean}\n */\nvar splitArray = function(nums) {\n  const length = nums.length;\n  if (length < 7) return false;\n\n  const prefixSums = new Array(length + 1).fill(0);\n  for (let i = 0; i < length; i++) {\n    prefixSums[i + 1] = prefixSums[i] + nums[i];\n  }\n\n  const getSum = (start, end) => prefixSums[end + 1] - prefixSums[start];\n\n  for (let j = 3; j < length - 3; j++) {\n    const seenSums = new Set();\n    for (let i = 1; i < j - 1; i++) {\n      const firstSum = getSum(0, i - 1);\n      const secondSum = getSum(i + 1, j - 1);\n      if (firstSum === secondSum) {\n        seenSums.add(firstSum);\n      }\n    }\n    for (let k = j + 2; k < length - 1; k++) {\n      const thirdSum = getSum(j + 1, k - 1);\n      const fourthSum = getSum(k + 1, length - 1);\n      if (thirdSum === fourthSum && seenSums.has(thirdSum)) {\n        return true;\n      }\n    }\n  }\n  return false;\n};","keywords":"LeetCode 548, #548 - Split Array with Equal Sum, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}