From 09ff55acc1d7c9b1264bb68cdf9d57d2bf513e13 Mon Sep 17 00:00:00 2001 From: Ben Makusha Date: Sat, 22 Nov 2025 22:26:40 -0500 Subject: [PATCH] update: [LEETCODE 3190] Find Minimum Operatins to make all elements divisible by three --- .../a3190/FindMinDivisibleByThree.java | 13 ++++++++ .../a3190/FindMinDivisibleByThreeTest.java | 32 +++++++++++++++++++ 2 files changed, 45 insertions(+) create mode 100644 src/main/java/problemset/a3190/FindMinDivisibleByThree.java create mode 100644 src/test/java/problemset/a3190/FindMinDivisibleByThreeTest.java diff --git a/src/main/java/problemset/a3190/FindMinDivisibleByThree.java b/src/main/java/problemset/a3190/FindMinDivisibleByThree.java new file mode 100644 index 0000000..81a0494 --- /dev/null +++ b/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; + } +} diff --git a/src/test/java/problemset/a3190/FindMinDivisibleByThreeTest.java b/src/test/java/problemset/a3190/FindMinDivisibleByThreeTest.java new file mode 100644 index 0000000..51a0547 --- /dev/null +++ b/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)); + } +} \ No newline at end of file