add 2937

Author: fishercoder1534

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

@@ -4,6 +4,7 @@
 | 2970 | [Count the Number of Incremovable Subarrays I](https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-i/)                                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2970.java)                                       |                                      | Easy                      |
 | 2965 | [Find Missing and Repeated Values](https://leetcode.com/problems/find-missing-and-repeated-values/)                                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2965.java)                                       |                                      | Easy                      |
 | 2942 | [Find Words Containing Character](https://leetcode.com/problems/find-words-containing-character/)                                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2942.java)                                       |                                      | Easy                      |
+| 2937 | [Make Three Strings Equal](https://leetcode.com/problems/make-three-strings-equal/)                                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2937.java)                                       |                                      | Easy                      |
 | 2864 | [Maximum Odd Binary Number](https://leetcode.com/problems/maximum-odd-binary-number/)                                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2864.java)                                       |                                      | Easy                      |Greedy
 | 2824 | [Count Pairs Whose Sum is Less than Target](https://leetcode.com/problems/count-pairs-whose-sum-is-less-than-target/)                                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2824.java)                                       |                                      | Easy                      |
 | 2812 | [Find the Safest Path in a Grid](https://leetcode.com/problems/find-the-safest-path-in-a-grid/)                                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2812.java)                                       |                                      | Medium                    |BFS

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

@@ -0,0 +1,29 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2937 {
+    public static class Solution1 {
+        public int findMinimumOperations(String s1, String s2, String s3) {
+            if (s1.charAt(0) != s2.charAt(0) || s1.charAt(0) != s3.charAt(0) || s2.charAt(0) != s3.charAt(0)) {
+                return -1;
+            }
+            int minOps = 0;
+            int minLen = Math.min(s1.length(), Math.min(s2.length(), s3.length()));
+            int i = 1, j = 1, k = 1;
+            for (; i < minLen && j < minLen && k < minLen; i++, j++, k++) {
+                if (s1.charAt(i) != s2.charAt(j) || s2.charAt(j) != s3.charAt(k)) {
+                    minOps += s1.length() - i;
+                    minOps += s2.length() - j;
+                    minOps += s3.length() - k;
+                    i = s1.length();
+                    j = s2.length();
+                    k = s3.length();
+                    break;
+                }
+            }
+            minOps += s1.length() - i;
+            minOps += s2.length() - j;
+            minOps += s3.length() - k;
+            return minOps;
+        }
+    }
+}

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

@@ -0,0 +1,31 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2937;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2937Test {
+    private static _2937.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2937.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(2, solution1.findMinimumOperations("abc", "abb", "ab"));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(3, solution1.findMinimumOperations("a", "aabc", "a"));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(7, solution1.findMinimumOperations("ca", "cccabb", "cb"));
+    }
+}