p117

Author: ashwanikumar04

AllQuestions.md

@@ -1863,7 +1863,7 @@ Generate a finite, but an arbitrarily large binary tree quickly in O(1).
 
 That is, generate() should return a tree whose size is unbounded but finite.
 
-## Problem-117:waxing_crescent_moon:
+## [Problem-117](src/main/java/in/ashwanik/dcp/problems/p91_120/p117):sunny:
 
 
 > This problem was asked by Facebook.

README.md

@@ -11,11 +11,11 @@ Solutions to the coding problems from [Daily coding problem](https://dailycoding
 |[P94](src/main/java/in/ashwanik/dcp/problems/p91_120/p94)|[P100](src/main/java/in/ashwanik/dcp/problems/p91_120/p100)|[P104](src/main/java/in/ashwanik/dcp/problems/p91_120/p104)|[P108](src/main/java/in/ashwanik/dcp/problems/p91_120/p108)|[P111](src/main/java/in/ashwanik/dcp/problems/p91_120/p111)|[P113](src/main/java/in/ashwanik/dcp/problems/p91_120/p113)|[P115](src/main/java/in/ashwanik/dcp/problems/p91_120/p115)|
 
 
-## **Facebook (16)**
+## **Facebook (17)**
 | | | | | | | | | | | | | | | |
 |--|--|--|--|--|--|--|--|--|--|--|--|--|--|--|
 |[P7](src/main/java/in/ashwanik/dcp/problems/p1_30/p7)|[P15](src/main/java/in/ashwanik/dcp/problems/p1_30/p15)|[P19](src/main/java/in/ashwanik/dcp/problems/p1_30/p19)|[P25](src/main/java/in/ashwanik/dcp/problems/p1_30/p25)|[P27](src/main/java/in/ashwanik/dcp/problems/p1_30/p27)|[P30](src/main/java/in/ashwanik/dcp/problems/p1_30/p30)|[P41](src/main/java/in/ashwanik/dcp/problems/p31_60/p41)|[P47](src/main/java/in/ashwanik/dcp/problems/p31_60/p47)|[P51](src/main/java/in/ashwanik/dcp/problems/p31_60/p51)|[P60](src/main/java/in/ashwanik/dcp/problems/p31_60/p60)|[P62](src/main/java/in/ashwanik/dcp/problems/p61_90/p62)|[P69](src/main/java/in/ashwanik/dcp/problems/p61_90/p69)|[P79](src/main/java/in/ashwanik/dcp/problems/p61_90/p79)|[P85](src/main/java/in/ashwanik/dcp/problems/p61_90/p85)|[P110](src/main/java/in/ashwanik/dcp/problems/p91_120/p110)|
-|[P114](src/main/java/in/ashwanik/dcp/problems/p91_120/p114)|
+|[P114](src/main/java/in/ashwanik/dcp/problems/p91_120/p114)|[P117](src/main/java/in/ashwanik/dcp/problems/p91_120/p117)|
 
 
 ## **Microsoft (11)**

src/main/java/in/ashwanik/dcp/problems/p91_120/p117/Readme.md

@@ -0,0 +1 @@
+Given a binary tree, return the level of the tree with minimum sum.

src/main/java/in/ashwanik/dcp/problems/p91_120/p117/Solution.java

@@ -0,0 +1,50 @@
+package in.ashwanik.dcp.problems.p91_120.p117;
+
+import in.ashwanik.dcp.common.TreeNode;
+
+import java.util.ArrayDeque;
+import java.util.Deque;
+
+class Solution {
+
+    int getLevelWithMinimumSum(TreeNode<Integer> root) {
+        if (root == null) {
+            return -1;
+        }
+
+        Deque<TreeNode<Integer>> queue = new ArrayDeque<>();
+        int minSum = Integer.MAX_VALUE;
+        int minLevel = -1;
+        int currentSum = 0;
+        int level = 0;
+        queue.offer(root);
+        TreeNode<Integer> dummy = new TreeNode<>(0);
+
+        queue.offer(dummy);
+
+        while (!queue.isEmpty()) {
+            TreeNode<Integer> current = queue.removeFirst();
+            if (current == dummy) {
+                if (currentSum < minSum) {
+                    minSum = currentSum;
+                    minLevel = level;
+                }
+                if (!queue.isEmpty()) {
+                    queue.offer(dummy);
+                }
+                level++;
+                currentSum = 0;
+            } else {
+                currentSum += current.getData();
+                if (current.getLeft() != null) {
+                    queue.offer(current.getLeft());
+                }
+                if (current.getRight() != null) {
+                    queue.offer(current.getRight());
+                }
+            }
+        }
+        return minLevel;
+    }
+
+}

src/test/java/in/ashwanik/dcp/problems/p91_120/p117/SolutionTest.java

@@ -0,0 +1,19 @@
+package in.ashwanik.dcp.problems.p91_120.p117;
+
+import in.ashwanik.dcp.common.TreeNode;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class SolutionTest {
+    @Test
+    void testMinimumSumLevel() {
+        TreeNode<Integer> root = new TreeNode<>(2,
+                new TreeNode<>(3,
+                        new TreeNode<>(-5),
+                        new TreeNode<>(4)),
+                new TreeNode<>(-2));
+
+        assertEquals(2, new Solution().getLevelWithMinimumSum(root));
+    }
+}