7

solutions/lc2154.py

@@ -0,0 +1,8 @@
+class Solution:
+    def findFinalValue(self, nums: List[int], original: int) -> int:
+        nums_s = set(nums)
+
+        while original in nums_s:
+            original *= 2
+
+        return original

solutions/lc747.py

@@ -0,0 +1,5 @@
+class Solution:
+    def dominantIndex(self, nums: List[int]) -> int:
+        nums_s = sorted(nums)
+
+        return nums.index(nums_s[-1]) if nums_s[-1] >= nums_s[-2] * 2 else -1