René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/split-array-largest-sum","name":"#410 - Split Array Largest Sum - LeetCode JavaScript Solutions","description":"Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized. ...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar splitArray = function(nums, k) {\n  let left = Math.max(...nums);\n  let right = nums.reduce((a, b) => a + b);\n\n  while (left < right) {\n    const mid = Math.floor((left + right) / 2);\n    let count = 1;\n    let sum = 0;\n\n    for (const num of nums) {\n      if (sum + num <= mid) {\n        sum += num;\n      } else {\n        count++;\n        sum = num;\n      }\n    }\n\n    if (count > k) {\n      left = mid + 1;\n    } else {\n      right = mid;\n    }\n  }\n\n  return left;\n};","keywords":"LeetCode 410, #410 - Split Array Largest Sum, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}