@scurrlin/stencil 1.30.3 → 1.30.4

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 309 "Best Time to Buy and Sell Stock with Cooldown":
+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 310 "Minimum Height Trees":
 
 ## Example
 
@@ -24,30 +24,62 @@ Solution
 
 ```python
 class Solution:
-    def maxProfit(self, prices: List[int]) -> int:
-        b = -10 ** 9
-        s = 0
-        s2 = 0
-        for i in range(len(prices)):
-            b = max(b, s2 - prices[i])
-            s2 = s
-            s = max(s, b + prices[i])
-        return s
+    def findMinHeightTrees(self, n: int, edges: List[List[int]]) -> List[int]:
+        if n == 1 or not edges:
+            return [0]
+        graph = collections.defaultdict(set)
+        ans = []
+        
+        for u, v in edges:
+            graph[u].add(v)
+            graph[v].add(u)
+
+        for label, children in graph.items():
+            if len(children) == 1:
+                ans.append(label)
+
+        while n > 2:
+            n -= len(ans)
+            nextLeaves = []
+            for leaf in ans:
+                u = next(iter(graph[leaf]))
+                graph[u].remove(leaf)
+                if len(graph[u]) == 1:
+                    nextLeaves.append(u)
+            ans = nextLeaves
+
+        return ans
 ```
 
 Solution with Stencil
 
 ```python
 c S:
-    d m(s, p: L[i]) -> i:
-        b = -1 ** 9
-        s = 0
-        s = 0
-        f i i r(l(p)):
-            b = m(b, s - p[i])
-            s = s
-            s = m(s, b + p[i])
-        r s
+    d f(s, n: i, e: L[L[i]]) -> L[i]:
+        i n == 1 o n e:
+            r [0]
+        g = c.d(s)
+        a = []
+        
+        f u, v i e:
+            g[u].a(v)
+            g[v].a(u)
+
+        f l, c i g.i():
+            i l(c) == 1:
+                a.a(l)
+
+        w n > 2:
+            n -= l(a)
+            n = []
+            f l i a:
+                u = n(i(g[l]))
+                g[u].r(l)
+                i l(g[u]) == 1:
+                    n.a(u)
+            a = n
+
+        r a
 ```
 
 ## Local Installation

package/package.json

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