@scurrlin/stencil 1.34.1 → 1.34.4

package/README.md

@@ -16,64 +16,38 @@ 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 363 "Max Sum of Rectangle No Larger Than K":
+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 368 "Largest Divisible Subset":
 
 ## Example
 
 Solution
 
 ```python
-from bisect import bisect_left, insort
-
 class Solution:
-    def maxSumSubmatrix(self, matrix, k):
-        ans = float("-inf")
-        m, n = len(matrix), len(matrix[0])
-        for left in range(n):
-            rowSums = [0] * m
-            
-            for right in range(left, n):
-                currSum, prefixSums = 0, [0]
-                
-                for r in range(m):
-                    rowSums[r] += matrix[r][right]
-                    currSum += rowSums[r]
-                    
-                    idx = bisect_left(prefixSums, currSum - k)
-                    
-                    if idx < len(prefixSums):
-                        ans = max(ans, currSum - prefixSums[idx])
-                    insort(prefixSums, currSum)
+    def largestDivisibleSubset(self, nums: List[int]) -> List[int]:
+        subsets = {}
+        for num in sorted(nums): 
+            subsets[num] = max(
+                [subsets[k] for k in subsets if num % k == 0],
+                key = len, default = set()
+            ) | {num}
         
-        return ans
+        return list(max(subsets.values(), key = len))
 ```
 
 Solution with Stencil
 
 ```python
-f b i b_l, i
-
 c S:
-    d m(s, m, k):
-        a = f("-i")
-        m, n = l(m), l(m[0])
-        f l i r(n):
-            r = [0] * m
-            
-            f r i r(l, n):
-                c, p = 0, [0]
-                
-                f r i r(m):
-                    r[r] += m[r][r]
-                    c += r[r]
-                    
-                    i = b_l(p, c - k)
-                    
-                    i i < l(p):
-                        a = m(a, c - p[i])
-                    i(p, c)
+    d l(s, n: L[i]) -> L[i]:
+        s = {}
+        f n i s(n): 
+            s[n] = m(
+                [s[k] f k i s i n % k == 0],
+                k = l, d = s()
+            ) | {n}
         
-        r a
+        r l(m(s.v(), k = l))
 ```
 
 ## Local Installation

package/package.json

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