add 1080

Author: fishercoder1534

paginated_contents/algorithms/2nd_thousand/README.md

@@ -414,6 +414,7 @@
 | 1087 | [Brace Expansion](https://leetcode.com/problems/brace-expansion/)                                                                                                                            | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1087.java)                                                                                       |                                                     | Medium                           | Backtracking                                                         |
 | 1086 | [High Five](https://leetcode.com/problems/high-five/)                                                                                                                                        | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1086.java)                                                                                       | [:tv:](https://www.youtube.com/watch?v=3iqC5J4l0Cc) | Easy                             ||
 | 1085 | [Sum of Digits in the Minimum Number](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number/)                                                                                    | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1085.java)                                                                                       | [:tv:](https://www.youtube.com/watch?v=GKYmPuHZpQg) | Easy                             ||
+| 1080 | [Insufficient Nodes in Root to Leaf Paths](https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths/)                                                                                                        | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1080.java)                                                                                       |                                                     | Medium                           |Tree, DFS
 | 1079 | [Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/)                                                                                                        | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1079.java)                                                                                       |                                                     | Medium                           ||
 | 1078 | [Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/)                                                                                                          | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1078.java)                                                                                       |                                                     | Easy                             ||
 | 1071 | [Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)                                                                                      | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/secondthousand/_1071.java)                                                                                       |                                                     | Easy                             ||

src/main/java/com/fishercoder/solutions/secondthousand/_1080.java

@@ -0,0 +1,27 @@
+package com.fishercoder.solutions.secondthousand;
+
+import com.fishercoder.common.classes.TreeNode;
+
+public class _1080 {
+    public static class Solution1 {
+        /**
+         * Credit: https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths/solutions/1340243/concise-dfs-solution-cpp-and-java-0ms/
+         * DFS does this very cleanly.
+         */
+        public TreeNode sufficientSubset(TreeNode root, int limit) {
+            return dfs(root, limit, 0);
+        }
+
+        private TreeNode dfs(TreeNode root, int limit, int sumThusFar) {
+            if (root == null) {
+                return null;
+            }
+            if (root.left == null && root.right == null) {
+                return root.val + sumThusFar < limit ? null : root;
+            }
+            root.left = dfs(root.left, limit, sumThusFar + root.val);
+            root.right = dfs(root.right, limit, sumThusFar + root.val);
+            return root.left == null && root.right == null ? null : root;
+        }
+    }
+}

src/test/java/com/fishercoder/secondthousand/_1080Test.java

@@ -0,0 +1,47 @@
+package com.fishercoder.secondthousand;
+
+import com.fishercoder.common.classes.TreeNode;
+import com.fishercoder.common.utils.TreeUtils;
+import com.fishercoder.solutions.secondthousand._1080;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import java.util.Arrays;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _1080Test {
+    private static _1080.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _1080.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, -3, -5, null, 4, null));
+        TreeUtils.printBinaryTree(root);
+        TreeNode expected = TreeUtils.constructBinaryTree(Arrays.asList(1, null, -3, 4));
+        TreeUtils.printBinaryTree(expected);
+        assertEquals(expected, solution1.sufficientSubset(root, -1));
+    }
+
+    @Test
+    public void test2() {
+        TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, -3, -5, 3, null, 4, null));
+        TreeUtils.printBinaryTree(root);
+        TreeNode expected = TreeUtils.constructBinaryTree(Arrays.asList(1, 2, -3, null, 3, null, 4));
+        TreeUtils.printBinaryTree(expected);
+        assertEquals(expected, solution1.sufficientSubset(root, -1));
+    }
+
+    @Test
+    public void test3() {
+        TreeNode root = TreeUtils.constructBinaryTree(Arrays.asList(5, 4, 8, 11, null, 17, 4, 7, 1, null, null, 5, 3));
+        TreeUtils.printBinaryTree(root);
+        TreeNode expected = TreeUtils.constructBinaryTree(Arrays.asList(5, 4, 8, 11, null, 17, 4, 7, null, null, null, 5));
+        TreeUtils.printBinaryTree(expected);
+        assertEquals(expected, solution1.sufficientSubset(root, 22));
+    }
+}