Add solution #57

Author: JoshCrozier

0057-insert-interval.js

@@ -0,0 +1,43 @@
+/**
+ * 57. Insert Interval
+ * https://leetcode.com/problems/insert-interval/
+ * Difficulty: Medium
+ *
+ * You are given an array of non-overlapping intervals intervals where
+ * intervals[i] = [starti, endi] represent the start and the end of the
+ * ith interval and intervals is sorted in ascending order by starti.
+ * You are also given an interval newInterval = [start, end] that
+ * represents the start and end of another interval.
+ *
+ * Insert newInterval into intervals such that intervals is still sorted
+ * in ascending order by starti and intervals still does not have any
+ * overlapping intervals (merge overlapping intervals if necessary).
+ *
+ * Return intervals after the insertion.
+ */
+
+/**
+ * @param {number[][]} intervals
+ * @param {number[]} newInterval
+ * @return {number[][]}
+ */
+var insert = function(intervals, newInterval) {
+  const result = [];
+
+  for (let i = 0; i < intervals.length; i++) {
+    if (newInterval[1] < intervals[i][0]) {
+      result.push(newInterval);
+      return [...result, ...intervals.slice(i)];
+    } else if (newInterval[0] > intervals[i][1]) {
+      result.push(intervals[i]);
+    } else {
+      newInterval = [
+        Math.min(newInterval[0], intervals[i][0]),
+        Math.max(newInterval[1], intervals[i][1]),
+      ];
+    }
+  }
+
+  result.push(newInterval);
+  return result;
+};

README.md

@@ -55,6 +55,7 @@
 50|[Pow(x, n)](./0050-powx-n.js)|Medium|
 53|[Maximum Subarray](./0053-maximum-subarray.js)|Easy|
 54|[Spiral Matrix](./0054-spiral-matrix.js)|Medium|
+57|[Insert Interval](./0057-insert-interval.js)|Medium|
 58|[Length of Last Word](./0058-length-of-last-word.js)|Easy|
 62|[Unique Paths](./0062-unique-paths.js)|Medium|
 66|[Plus One](./0066-plus-one.js)|Easy|