add 3189

Author: fishercoder1534

paginated_contents/algorithms/4th_thousand/README.md

@@ -5,7 +5,8 @@
 | 3194 | [Minimum Average of Smallest and Largest Elements](https://leetcode.com/problems/minimum-average-of-smallest-and-largest-elements/) | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3194.java) |                                                                               | Easy       |
 | 3192 | [Minimum Operations to Make Binary Array Elements Equal to One II](https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/) | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3192.java) |                                                                               | Medium     |
 | 3191 | [Minimum Operations to Make Binary Array Elements Equal to One I](https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i/)   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3191.java) |                                                                               | Medium     |
-| 3190 | [Find Minimum Operations to Make All Elements Divisible by Three](https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/)   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3190.java) |                                                                               | Easy       | 
+| 3190 | [Find Minimum Operations to Make All Elements Divisible by Three](https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/)   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3190.java) |                                                                               | Easy       |
+| 3189 | [Minimum Moves to Get a Peaceful Board](https://leetcode.com/problems/minimum-moves-to-get-a-peaceful-board/)                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3186.java) |                                                                               | Medium     | Greedy
 | 3186 | [Maximum Total Damage With Spell Casting](https://leetcode.com/problems/maximum-total-damage-with-spell-casting/)                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3186.java) |                                                                               | Medium     | DP
 | 3185 | [Count Pairs That Form a Complete Day II](https://leetcode.com/problems/count-pairs-that-form-a-complete-day-ii/)                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3185.java) |                                                                               | Medium     |
 | 3184 | [Count Pairs That Form a Complete Day I](https://leetcode.com/problems/count-pairs-that-form-a-complete-day-i/)                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3184.java) |                                                                               | Easy       |

src/main/java/com/fishercoder/solutions/fourththousand/_3189.java

@@ -0,0 +1,28 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.Arrays;
+
+public class _3189 {
+    public static class Solution1 {
+        /**
+         * Greedy is the way to go for this problem.
+         */
+        public int minMoves(int[][] rooks) {
+            Arrays.sort(rooks, (a, b) -> a[0] - b[0]);
+            int len = rooks.length;
+            int moves = 0;
+            for (int i = 0; i < len; i++) {
+                int[] rook = rooks[i];
+                //move each rook to row i
+                moves += Math.abs(rook[0] - i);
+            }
+            Arrays.sort(rooks, (a, b) -> a[1] - b[1]);
+            for (int i = 0; i < len; i++) {
+                int[] rook = rooks[i];
+                //move each rook to its column i
+                moves += Math.abs(rook[1] - i);
+            }
+            return moves;
+        }
+    }
+}

src/test/java/com/fishercoder/fourththousand/_3189Test.java

@@ -0,0 +1,24 @@
+package com.fishercoder.fourththousand;
+
+import com.fishercoder.solutions.fourththousand._3189;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _3189Test {
+    private static _3189.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _3189.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(3, solution1.minMoves(new int[][]{
+                {0, 0}, {1, 0}, {1, 1}
+        }));
+    }
+
+}