add 2583

fishercoder1534 · fishercoder1534 · commit ecb4e6848e47 · 2023-03-04T20:11:03.000-08:00
diff --git a/README.md b/README.md
@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ &#9733;
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty                       | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
-| 2582 |[Pass the Pillow](https://leetcode.com/problems/pass-the-pillow/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2582.java)                                                                      |                                                                               | Easy                             |
+| 2583 |[Kth Largest Sum in a Binary Tree](https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2583.java)                                                                     |                                                                               | Medium                           |
+| 2582 |[Pass the Pillow](https://leetcode.com/problems/pass-the-pillow/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2582.java)                                                                     |                                                                               | Easy                             |
 | 2566 |[Maximum Difference by Remapping a Digit](https://leetcode.com/problems/maximum-difference-by-remapping-a-digit/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2566.java)                                                                     |                                                                               | Easy                             |
 | 2562 |[Find the Array Concatenation Value](https://leetcode.com/problems/find-the-array-concatenation-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2562.java)                                                                     |                                                                               | Easy                             |
 | 2559 |[Count Vowel Strings in Ranges](https://leetcode.com/problems/count-vowel-strings-in-ranges/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2559.java)                                                                     |                                                                               | Medium                           |
diff --git a/src/main/java/com/fishercoder/solutions/_2583.java b/src/main/java/com/fishercoder/solutions/_2583.java
@@ -0,0 +1,32 @@
+package com.fishercoder.solutions;
+
+import com.fishercoder.common.classes.TreeNode;
+
+import java.util.*;
+
+public class _2583 {
+    public static class Solution1 {
+        public long kthLargestLevelSum(TreeNode root, int k) {
+            List<Long> list = new ArrayList<>();
+            Queue<TreeNode> queue = new LinkedList<>();
+            queue.offer(root);
+            while (!queue.isEmpty()) {
+                int size = queue.size();
+                long thisSum = 0l;
+                for (int i = 0; i < size; i++) {
+                    TreeNode curr = queue.poll();
+                    thisSum += curr.val;
+                    if (curr.left != null) {
+                        queue.offer(curr.left);
+                    }
+                    if (curr.right != null) {
+                        queue.offer(curr.right);
+                    }
+                }
+                list.add(thisSum);
+            }
+            Collections.sort(list, Collections.reverseOrder());
+            return k > list.size() ? -1 : list.get(k - 1);
+        }
+    }
+}
