add 2644

Author: fishercoder1534

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

@@ -24,6 +24,7 @@
 | 2656 | [Maximum Sum With Exactly K Elements](https://leetcode.com/problems/maximum-sum-with-exactly-k-elements/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2656.java)                                       |                                      | Easy                           |
 | 2652 | [Sum Multiples](https://leetcode.com/problems/sum-multiples/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2652.java)                                       |                                      | Easy                           |
 | 2651 | [Calculate Delayed Arrival Time](https://leetcode.com/problems/calculate-delayed-arrival-time/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2651.java)                                       |                                      | Easy                           |
+| 2644 | [Find the Maximum Divisibility Score](https://leetcode.com/problems/find-the-maximum-divisibility-score/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2644.java)                                       |                                      | Easy                           |
 | 2643 | [Row With Maximum Ones](https://leetcode.com/problems/row-with-maximum-ones/)                                                                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2643.java)                                       |                                      | Easy                           |
 | 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
 | 2605 | [Form Smallest Number From Two Digit Arrays](https://leetcode.com/problems/form-smallest-number-from-two-digit-arrays/)                                                                                      | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2605.java)                                       |                                      | Easy                           |

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

@@ -0,0 +1,35 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2644 {
+    public static class Solution1 {
+        public int maxDivScore(int[] nums, int[] divisors) {
+            int[][] scores = new int[divisors.length][2];
+            for (int i = 0; i < divisors.length; i++) {
+                int score = 0;
+                for (int j = 0; j < nums.length; j++) {
+                    if (nums[j] % divisors[i] == 0) {
+                        score++;
+                    }
+                }
+                scores[i][0] = score;
+                scores[i][1] = divisors[i];
+            }
+            int maxScore = -1;
+            for (int i = 0; i < divisors.length; i++) {
+                maxScore = Math.max(maxScore, scores[i][0]);
+            }
+            int ans = Integer.MAX_VALUE;
+            for (int i = 0; i < divisors.length; i++) {
+                if (maxScore == scores[i][0]) {
+                    if (ans > scores[i][1]) {
+                        ans = scores[i][1];
+                    }
+                } else if (maxScore < scores[i][0]) {
+                    maxScore = scores[i][0];
+                    ans = scores[i][1];
+                }
+            }
+            return ans;
+        }
+    }
+}

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

@@ -0,0 +1,23 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2644;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2644Test {
+    private static _2644.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2644.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.maxDivScore(new int[]{2, 9, 15, 50}, new int[]{5, 3, 7, 2}));
+    }
+
+
+}