2154. Keep Multiplying Found Values by Two

unicoder88 · unicoder88 · commit 0814caaa7180 · 2025-11-19T16:58:11.000+01:00
diff --git a/src/main/java/com/rkabanov/leetcode/p2154/Solution.java b/src/main/java/com/rkabanov/leetcode/p2154/Solution.java
@@ -0,0 +1,25 @@
+package com.rkabanov.leetcode.p2154;
+
+import java.util.HashSet;
+
+/**
+ * <a href="https://leetcode.com/problems/keep-multiplying-found-values-by-two/description/">2154. Keep Multiplying Found Values by Two</a>
+ */
+public class Solution {
+    public int findFinalValue(int[] nums, int original) {
+        // unsorted (1,1000) numbers [5, 3, 6, 1, 12]
+        HashSet<Integer> set = new HashSet<>(nums.length);
+        for (int num : nums) {
+            set.add(num);
+        }
+
+        // given 3, search 3, 6, 12, 24, 48, ...
+        int candidate = original;
+
+        while (set.contains(candidate)) {
+            candidate *= 2;
+        }
+
+        return candidate;
+    }
+}
diff --git a/src/test/java/com/rkabanov/leetcode/p2154/SolutionTest.java b/src/test/java/com/rkabanov/leetcode/p2154/SolutionTest.java
@@ -0,0 +1,21 @@
+package com.rkabanov.leetcode.p2154;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class SolutionTest {
+    @Test
+    public void testExample1() {
+        var solution = new Solution();
+        int result = solution.findFinalValue(new int[]{5, 3, 6, 1, 12}, 3);
+        assertEquals(24, result);
+    }
+
+    @Test
+    public void testExample2() {
+        var solution = new Solution();
+        int result = solution.findFinalValue(new int[]{2, 7, 9}, 4);
+        assertEquals(4, result);
+    }
+}
