D. J.:

- Added the leetcode problem and solution for 2154

Author: nobodyPerfecZ

README.md

@@ -297,6 +297,7 @@
 - [1935 Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/description/)
 - [1964 Find the Longest Valid Obstacle Course at Each Position](https://leetcode.com/problems/find-the-longest-valid-obstacle-course-at-each-position/description/)
 - [2140 Solving Questions With Brainpower](https://leetcode.com/problems/solving-questions-with-brainpower/description/)
+- [2154 Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/description/)
 - [2215 Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/description/)
 - [2353 Design a Food Rating System](https://leetcode.com/problems/design-a-food-rating-system/description/)
 - [2390 Removing Stars From a String](https://leetcode.com/problems/removing-stars-from-a-string/description/)

awesome_python_leetcode/_2154_keep_multiplying_found_values_by_two.py

@@ -0,0 +1,26 @@
+from typing import List
+
+
+class Solution:
+    """Base class for all LeetCode Problems."""
+
+    def findFinalValue(self, nums: List[int], original: int) -> int:
+        """
+        You are given an array of integers nums. You are also given an integer original
+        which is the first number that needs to be searched for in nums.
+
+        You then do the following steps:
+        1. If original is found in nums, multiply it by two (i.e., set original = 2 *
+        original).
+        2. Otherwise, stop the process.
+        3. Repeat this process with the new number as long as you keep finding the
+        number.
+
+        Return the final value of original.
+        """
+        # Time Complexity: O(1)
+        # Space Complexity: O(n)
+        nums = set(nums)
+        while original in nums:
+            original *= 2
+        return original

tests/test_2154_keep_multiplying_found_values_by_two.py

@@ -0,0 +1,18 @@
+from typing import List
+
+import pytest
+
+from awesome_python_leetcode._2154_keep_multiplying_found_values_by_two import Solution
+
+
+@pytest.mark.parametrize(
+    argnames=["nums", "original", "expected"],
+    argvalues=[
+        ([5, 3, 6, 1, 12], 3, 24),
+        ([2, 7, 9], 4, 4),
+    ],
+)
+def test_func(nums: List[int], original: int, expected: int):
+    """Tests the solution of a LeetCode problem."""
+    final_value = Solution().findFinalValue(nums, original)
+    assert final_value == expected