add 2591

Author: fishercoder1534

Diff for: paginated_contents/algorithms/3rd_thousand/README.md

@@ -23,6 +23,7 @@
 | 2641 | [Cousins in Binary Tree II](https://leetcode.com/problems/cousins-in-binary-tree-ii/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2641.java)                                       |                                      | Medium                         |Tree, BFS, HashTable
 | 2596 | [Check Knight Tour Configuration](https://leetcode.com/problems/check-knight-tour-configuration/)                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2596.java)                                       | [:tv:](https://youtu.be/OBht8NT_09c) | Medium                         |
 | 2595 | [Number of Even and Odd Bits](https://leetcode.com/problems/number-of-even-and-odd-bits/)                                                                                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2595.java)                                       |                                      | Easy                           |
+| 2591 | [Distribute Money to Maximum Children](https://leetcode.com/problems/distribute-money-to-maximum-children/)                                                                                                    | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2591.java)                                       |                                      | Easy                           |
 | 2586 | [Count the Number of Vowel Strings in Range](https://leetcode.com/problems/count-the-number-of-vowel-strings-in-range/)                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2586.java)                                       |                                      | Easy                           |
 | 2583 | [Kth Largest Sum in a Binary Tree](https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree/)                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2583.java)                                       |                                      | Medium                         |
 | 2582 | [Pass the Pillow](https://leetcode.com/problems/pass-the-pillow/)                                                                                                                            | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2582.java)                                       |                                      | Easy                           |

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2591.java

@@ -0,0 +1,39 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.PriorityQueue;
+
+public class _2591 {
+    public static class Solution1 {
+        public int distMoney(int money, int children) {
+            if (money / children == 8 && money % children == 0) {
+                return children;
+            }
+            if (money < children) {
+                return -1;
+            }
+            PriorityQueue<Integer> minHeap = new PriorityQueue<>();
+            for (int i = 0; i < children; i++) {
+                minHeap.offer(1);
+                money--;
+            }
+            int maxEights = 0;
+            while (!minHeap.isEmpty() && money > 0) {
+                Integer curr = minHeap.poll();
+                if (money < 7) {
+                    curr += money;
+                    minHeap.offer(curr);
+                    break;
+                } else if (minHeap.size() > 0) {
+                    money -= 7;
+                    maxEights++;
+                } else if (minHeap.size() == 0) {
+                    break;
+                }
+            }
+            if (!minHeap.isEmpty() && minHeap.peek() == 4) {
+                maxEights--;
+            }
+            return maxEights;
+        }
+    }
+}

Diff for: src/test/java/com/fishercoder/thirdthousand/_2591Test.java

@@ -0,0 +1,36 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2591;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2591Test {
+    private static _2591.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2591.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.distMoney(13, 3));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(1, solution1.distMoney(17, 2));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(1, solution1.distMoney(20, 3));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(2, solution1.distMoney(16, 2));
+    }
+}