Add solution #1080

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,127 LeetCode solutions in JavaScript
+# 1,128 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -867,6 +867,7 @@
 1074|[Number of Submatrices That Sum to Target](./solutions/1074-number-of-submatrices-that-sum-to-target.js)|Hard|
 1078|[Occurrences After Bigram](./solutions/1078-occurrences-after-bigram.js)|Easy|
 1079|[Letter Tile Possibilities](./solutions/1079-letter-tile-possibilities.js)|Medium|
+1080|[Insufficient Nodes in Root to Leaf Paths](./solutions/1080-insufficient-nodes-in-root-to-leaf-paths.js)|Medium|
 1081|[Smallest Subsequence of Distinct Characters](./solutions/1081-smallest-subsequence-of-distinct-characters.js)|Medium|
 1092|[Shortest Common Supersequence](./solutions/1092-shortest-common-supersequence.js)|Hard|
 1103|[Distribute Candies to People](./solutions/1103-distribute-candies-to-people.js)|Easy|

solutions/1080-insufficient-nodes-in-root-to-leaf-paths.js

@@ -0,0 +1,43 @@
+/**
+ * 1080. Insufficient Nodes in Root to Leaf Paths
+ * https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths/
+ * Difficulty: Medium
+ *
+ * Given the root of a binary tree and an integer limit, delete all insufficient nodes in the
+ * tree simultaneously, and return the root of the resulting binary tree.
+ *
+ * A node is insufficient if every root to leaf path intersecting this node has a sum strictly
+ * less than limit.
+ *
+ * A leaf is a node with no children.
+ */
+
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @param {number} limit
+ * @return {TreeNode}
+ */
+var sufficientSubset = function(root, limit) {
+  return checkPath(root, 0) ? root : null;
+
+  function checkPath(node, sum) {
+    if (!node) return false;
+    if (!node.left && !node.right) return sum + node.val >= limit;
+
+    const leftValid = checkPath(node.left, sum + node.val);
+    const rightValid = checkPath(node.right, sum + node.val);
+
+    if (!leftValid) node.left = null;
+    if (!rightValid) node.right = null;
+
+    return leftValid || rightValid;
+  }
+};