@scurrlin/stencil 1.13.0 → 1.13.1

package/README.md

@@ -16,7 +16,7 @@ Whether you are studying for technical interviews, or just starting your coding
 
 Most people when they attempt to memorize something study the full text and then attempt to regurgitate it on a blank page. Shocking, I know... but what if there was a step in between? What if memorization and pattern recognition weren't all or nothing games? This is where Stencil comes in.
 
-Stencil is a language-agnostic memorization tool that strips code files down to their first letters while preserving spacing, capitalization, and punctuation. The "stencil" of the file is designed to act as a bridge between having something partially memorized and fully memorized. Below is an example of Stencil in action using LeetCode problem 93 "Restore IP Addresses":
+Stencil is a language-agnostic memorization tool that strips code files down to their first letters while preserving spacing, capitalization, and punctuation. The "stencil" of the file is designed to act as a bridge between having something partially memorized and fully memorized. Below is an example of Stencil in action using LeetCode problem 94 "Binary Tree Inorder Traversal":
 
 ## Example
 
@@ -24,58 +24,32 @@ Solution
 
 ```python
 class Solution:
-    def valid(self, temp: str) -> bool:
-        if len(temp) > 3 or len(temp) == 0:
-            return False
-        if len(temp) > 1 and temp[0] == '0':
-            return False
-        if len(temp) and int(temp) > 255:
-            return False
-        return True
-
-    def solve(self, ans, output, ind, s, dots):
-        if dots == 3:
-            if self.valid(s[ind:]):
-                ans.append(output + s[ind:])
-            return
-        for i in range(ind, min(ind + 3, len(s))):
-            if self.valid(s[ind:i + 1]):
-                new_output = output + s[ind:i + 1] + '.'
-                self.solve(ans, new_output, i + 1, s, dots + 1)
-
-    def restoreIpAddresses(self, s: str) -> List[str]:
-        ans = []
-        self.solve(ans, "", 0, s, 0)
-        return ans
+    def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
+        output = []
+        def inorder(root):
+            if root is None:
+                return
+            inorder(root.left)
+            output.append(root.val)
+            inorder(root.right)
+        inorder(root)
+        return output
 ```
 
 Solution with Stencil
 
 ```python
 c S:
-    d v(s, t: s) -> b:
-        i l(t) > 3 o l(t) == 0:
-            r F
-        i l(t) > 1 a t[0] == '0':
-            r F
-        i l(t) a i(t) > 2:
-            r F
-        r T
-
-    d s(s, a, o, i, s, d):
-        i d == 3:
-            i s.v(s[i:]):
-                a.a(o + s[i:])
-            r
-        f i i r(i, m(i + 3, l(s))):
-            i s.v(s[i:i + 1]):
-                n_o = o + s[i:i + 1] + '.'
-                s.s(a, n_o, i + 1, s, d + 1)
-
-    d r(s, s: s) -> L[s]:
-        a = []
-        s.s(a, "", 0, s, 0)
-        r a
+    d i(s, r: O[T]) -> L[i]:
+        o = []
+        d i(r):
+            i r i N:
+                r
+            i(r.l)
+            o.a(r.v)
+            i(r.r)
+        i(r)
+        r o
 ```
 
 ## Local Installation

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@scurrlin/stencil",
-  "version": "1.13.0",
+  "version": "1.13.1",
   "description": "A memorization tool that strips code down to first letters and punctuation only.",
   "main": "src/index.js",
   "bin": {