add 2744

Author: fishercoder1534

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

@@ -14,6 +14,7 @@
 | 2760 | [Longest Even Odd Subarray With Threshold](https://leetcode.com/problems/longest-even-odd-subarray-with-threshold/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2760.java)                                       |                                 | Easy                           |
 | 2751 | [Robot Collisions](https://leetcode.com/problems/robot-collisions/)                                                                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2751.java)                                       |                                 | Hard                           | Stack, Simulation
 | 2748 | [Number of Beautiful Pairs](https://leetcode.com/problems/number-of-beautiful-pairs/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2748.java)                                       |  | Easy                           |
+| 2744 | [Find Maximum Number of String Pairs](https://leetcode.com/problems/find-maximum-number-of-string-pairs/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2744.java)                                       |  | Easy                           |
 | 2716 | [Minimize String Length](https://leetcode.com/problems/minimize-string-length/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2716.java)                                       | [:tv:](https://youtu.be/aMJ3T0K8LjI) | Easy                           |
 | 2710 | [Remove Trailing Zeros From a String](https://leetcode.com/problems/remove-trailing-zeros-from-a-string/)                                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2710.java)                                       |                                 | Easy                           |
 | 2706 | [Buy Two Chocolates](https://leetcode.com/problems/buy-two-chocolates/)                                                                                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2706.java)                                       |                                 | Easy                           |

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

@@ -0,0 +1,33 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2744 {
+    public static class Solution1 {
+        public int maximumNumberOfStringPairs(String[] words) {
+            int pairs = 0;
+            for (int i = 0; i < words.length - 1; i++) {
+                for (int j = i + 1; j < words.length; j++) {
+                    if (couldPair(words[i], words[j])) {
+                        pairs++;
+                    }
+                }
+            }
+            return pairs;
+        }
+
+        private boolean couldPair(String word1, String word2) {
+            if (word1.length() != word2.length()) {
+                return false;
+            }
+            int left = 0;
+            int right = word1.length() - 1;
+            while (left < right) {
+                if (word1.charAt(left) != word2.charAt(right)) {
+                    return false;
+                }
+                left++;
+                right--;
+            }
+            return word1.charAt(left) == word2.charAt(right);
+        }
+    }
+}

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

@@ -0,0 +1,22 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2744;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2744Test {
+    private static _2744.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2744.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.maximumNumberOfStringPairs(new String[]{"cd", "ac", "dc", "ca", "zz"}));
+    }
+
+}