add 3157

Author: fishercoder1534

Diff for: paginated_contents/algorithms/4th_thousand/README.md

@@ -8,6 +8,7 @@
 | 3174 | [Clear Digits](https://leetcode.com/problems/clear-digits/)                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3174.java) |                                                                               | Easy       |
 | 3164 | [Find the Number of Good Pairs II](https://leetcode.com/problems/find-the-number-of-good-pairs-ii/)                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3164.java) |                                                                               | Medium     |
 | 3162 | [Find the Number of Good Pairs I](https://leetcode.com/problems/find-the-number-of-good-pairs-i/)                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3162.java) |                                                                               | Easy       |
+| 3157 | [Find the Level of Tree with Minimum Sum](https://leetcode.com/problems/find-the-level-of-tree-with-minimum-sum/)                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3157.java) |                                                                               | Medium     |BFS
 | 3131 | [Find the Integer Added to Array I](https://leetcode.com/problems/find-the-integer-added-to-array-i/)                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3131.java) |                                                                               | Easy       |
 | 3127 | [Make a Square with the Same Color](https://leetcode.com/problems/make-a-square-with-the-same-color/)                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3127.java) |                                                                               | Easy       |
 | 3120 | [Count the Number of Special Characters I](https://leetcode.com/problems/count-the-number-of-special-characters-i/)                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3120.java) |                                                                               | Easy       |

Diff for: src/main/java/com/fishercoder/solutions/_3157.java

@@ -0,0 +1,37 @@
+package com.fishercoder.solutions;
+
+import com.fishercoder.common.classes.TreeNode;
+
+import java.util.LinkedList;
+import java.util.Queue;
+import java.util.TreeMap;
+
+public class _3157 {
+    public static class Solution1 {
+        public int minimumLevel(TreeNode root) {
+            Queue<TreeNode> q = new LinkedList<>();
+            q.offer(root);
+            TreeMap<Long, Integer> treeMap = new TreeMap<>();
+            int level = 1;
+            while (!q.isEmpty()) {
+                int size = q.size();
+                long sum = 0L;
+                for (int i = 0; i < size; i++) {
+                    TreeNode curr = q.poll();
+                    sum += curr.val;
+                    if (curr.left != null) {
+                        q.offer(curr.left);
+                    }
+                    if (curr.right != null) {
+                        q.offer(curr.right);
+                    }
+                }
+                if (!treeMap.containsKey(sum)) {
+                    treeMap.put(sum, level);
+                }
+                level++;
+            }
+            return treeMap.firstEntry().getValue();
+        }
+    }
+}