update: [LEETCODE 3190] Find Minimum Operatins to make all elements divisible by three

src/main/java/problemset/a3190/FindMinDivisibleByThree.java

@@ -0,0 +1,13 @@
+package problemset.a3190;
+
+public class FindMinDivisibleByThree {
+
+    public int findMinimumOperations(int[] nums) {
+        int res = 0;
+        for (int n : nums) {
+            if (n % 3 != 0)
+                res++;
+        }
+        return res;
+    }
+}

src/test/java/problemset/a3190/FindMinDivisibleByThreeTest.java

@@ -0,0 +1,32 @@
+package problemset.a3190;
+
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.*;
+
+class FindMinDivisibleByThreeTest {
+
+    private FindMinDivisibleByThree finder;
+
+    private int[] testcaseOne;
+    private int[] testcaseTwo;
+
+    @BeforeEach
+    void setUp() {
+        finder = new FindMinDivisibleByThree();
+
+        testcaseOne = new int[]{1,2,3,4};
+        testcaseTwo = new int[]{3, 6, 9};
+    }
+
+    @Test
+    void test_findMinimumOperations_one() {
+        assertEquals(3, finder.findMinimumOperations(testcaseOne));
+    }
+
+    @Test
+    void test_findMinimumOperations_two() {
+        assertEquals(0, finder.findMinimumOperations(testcaseTwo));
+    }
+}