René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/insert-interval","name":"#57 - Insert Interval - LeetCode JavaScript Solutions","description":"You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[][]} intervals\n * @param {number[]} newInterval\n * @return {number[][]}\n */\nvar insert = function(intervals, newInterval) {\n  const result = [];\n\n  for (let i = 0; i < intervals.length; i++) {\n    if (newInterval[1] < intervals[i][0]) {\n      result.push(newInterval);\n      return [...result, ...intervals.slice(i)];\n    } else if (newInterval[0] > intervals[i][1]) {\n      result.push(intervals[i]);\n    } else {\n      newInterval = [\n        Math.min(newInterval[0], intervals[i][0]),\n        Math.max(newInterval[1], intervals[i][1]),\n      ];\n    }\n  }\n\n  result.push(newInterval);\n  return result;\n};","keywords":"LeetCode 57, #57 - Insert Interval, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}