Do weekly premium

Author: Zanger67

my-submissions/m1055 v1.py

@@ -0,0 +1,27 @@
+class Solution:
+    def shortestWay(self, source: str, target: str) -> int:
+        s = t = output = 0
+
+        while t < len(target) :
+            loop = len(source)
+
+            while loop >= 0 and source[s] != target[t] :
+                s += 1
+                loop -= 1
+                if s >= len(source) :
+                    output += 1
+                    s -= len(source)
+
+            if source[s] != target[t] :
+                return -1
+
+            s += 1
+            t += 1
+            if s >= len(source) :
+                output += 1
+                s -= len(source)
+
+        if s > 0 :
+            output += 1
+
+        return output

my-submissions/m1055 v2.py

@@ -0,0 +1,17 @@
+class Solution:
+    def shortestWay(self, source: str, target: str) -> int:
+        s = output = 0
+
+        for t in target :
+            for _ in repeat(None, len(source)) :
+                if source[s] == t :
+                    break
+                s = (s + 1) % len(source)
+                output += 1
+
+            if source[s] != t :
+                return -1
+            output += 1
+            s = (s + 1) % len(source)
+
+        return ceil(output / len(source))