add 2839

Author: fishercoder1534

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

@@ -7,6 +7,7 @@
 | 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
+| 2839 | [Check if Strings Can be Made Equal With Operations I](https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-i/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2839.java)                                       |                                      | Easy                                     |
 | 2833 | [Furthest Point From Origin](https://leetcode.com/problems/furthest-point-from-origin/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2833.java)                                       |                                      | Easy                                     |
 | 2828 | [Check if a String Is an Acronym of Words](https://leetcode.com/problems/check-if-a-string-is-an-acronym-of-words/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2828.java)                                       |                                      | Easy                                     |
 | 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                                     |

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

@@ -0,0 +1,54 @@
+package com.fishercoder.solutions.thirdthousand;
+
+import java.util.Arrays;
+
+public class _2839 {
+    public static class Solution1 {
+        /**
+         * Only a total of 6 possibilities, try them all.
+         */
+        public boolean canBeEqual(String s1, String s2) {
+            if (s1.equals(s2)) {
+                return true;
+            }
+            char[] c1 = s1.toCharArray();
+            char[] c2 = s2.toCharArray();
+            for (int i = 0; i < 2; i++) {
+                swap(c1, i);
+                if (Arrays.equals(c1, c2)) {
+                    return true;
+                }
+            }
+            c1 = s1.toCharArray();
+            c2 = s2.toCharArray();
+            //swap only (1,3) for c1 now
+            swap(c1, 1);
+            if (Arrays.equals(c1, c2)) {
+                return true;
+            }
+
+            c1 = s1.toCharArray();
+            c2 = s2.toCharArray();
+            for (int i = 0; i < 2; i++) {
+                swap(c2, i);
+                if (Arrays.equals(c1, c2)) {
+                    return true;
+                }
+            }
+            c1 = s1.toCharArray();
+            c2 = s2.toCharArray();
+            //swap only (1,3) for c2 now
+            swap(c2, 1);
+            if (Arrays.equals(c1, c2)) {
+                return true;
+            }
+            return false;
+        }
+
+        private void swap(char[] c, int i) {
+            char tmp = c[i];
+            c[i] = c[i + 2];
+            c[i + 2] = tmp;
+        }
+    }
+}

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

@@ -0,0 +1,21 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2839;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertTrue;
+
+public class _2839Test {
+    private static _2839.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2839.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertTrue(solution1.canBeEqual("bnxw", "bwxn"));
+    }
+}