daily

Author: Zanger67

.tours/example_tour.tour

@@ -0,0 +1,42 @@
+{
+  "$schema": "https://aka.ms/codetour-schema",
+  "title": "example_tour",
+  "steps": [
+    {
+      "file": "markdowns/Daily_Questions.md",
+      "description": "List of daily questions in a generated markdown file",
+      "line": 1
+    },
+    {
+      "file": "markdowns/Daily_Questions.md",
+      "description": "A hard question",
+      "line": 45
+    },
+    {
+      "file": "markdowns/_2493. Divide Nodes Into the Maximum Number of Groups.md",
+      "description": "The solution for the previous question",
+      "line": 98
+    },
+    {
+      "file": "my-submissions/h2493.py",
+      "description": "The actual solution file\n",
+      "line": 1
+    },
+    {
+      "file": "my-submissions/h2493.py",
+      "description": "Helper method called \"furthest_vertex\"",
+      "line": 3
+    },
+    {
+      "file": "my-submissions/h2493.py",
+      "description": "Helper method called \"odd_cycle_len\"",
+      "line": 25
+    },
+    {
+      "file": "my-submissions/h2493.py",
+      "description": "Main solving method for the problem called \"magnificentSets\"",
+      "line": 37
+    }
+  ],
+  "ref": "main"
+}

my-submissions/m1780 oneliner.py

@@ -0,0 +1,3 @@
+class Solution:
+    def checkPowersOfThree(self, n: int) -> bool:
+        return all((n % 3 ** (x + 1)) // (3 ** x) != 2 for x in range(int(n ** (1 / 3)), -1, -1))

my-submissions/m1780.py

@@ -0,0 +1,13 @@
+class Solution:
+    def checkPowersOfThree(self, n: int) -> bool:
+        x = 1
+        while x * 3 <= n :
+            x *= 3
+
+        while n :
+            if n - 2 * x >= 0 :
+                return False
+            n %= x
+            x //= 3
+
+        return True