Created oneliners for the daily for fun

Author: Zanger67

my-submissions/m1415 v2 cursed oneliner expanded.py

@@ -0,0 +1,18 @@
+class Solution:
+    def getHappyString(self, n: int, k: int) -> str:
+        return (
+            _pm_dfs := (
+                lambda rem, n, output: 
+                    ''.join(output) if not n else 
+                    _pm_dfs(
+                        rem - (pot_per_path if (temp := int(rem > (pot_per_path := 2 ** (n - 1)))) else 0), 
+                        n - 1, 
+                        output + ['abc'.replace(output[-1], '')[temp]]
+                    )
+            )
+        )(
+            k - x * pot_n_min_1,
+            n, 
+            [chr(ord('a') + x)]
+        ) if (x := (k - 1) // (pot_n_min_1 := 2 ** (n := n - 1))) <= 2 else \
+        ''

my-submissions/m1415 v2 oneliner.py

@@ -0,0 +1,3 @@
+class Solution:
+    def getHappyString(self, n: int, k: int) -> str:
+        return (_pm_dfs := (lambda rem, n, output: ''.join(output) if not n else _pm_dfs(rem - (pot_per_path if (temp := int(rem > (pot_per_path := 2 ** (n - 1)))) else 0), n - 1, output + ['abc'.replace(output[-1], '')[temp]])))(k - x * pot_n_min_1,n, [chr(ord('a') + x)]) if (x := (k - 1) // (pot_n_min_1 := 2 ** (n := n - 1))) <= 2 else ''

my-submissions/m1415.md

@@ -0,0 +1,7 @@
+### V1
+
+My initial attempt which was quite optimal. Achieves $O(n)$ using combinatorics where $n$ is the length of the output string aka the input $n$.
+
+### V2
+
+A oneliner I produced with walrus operators. Both in an expanded "bit more readable" version and in the pure oneline state.