Update

Author: jwl-7

src/code/javascript/data_structures/trie.js

@@ -17,42 +17,39 @@ class Trie {
     }
 
     insert(word) {
-        let curr = this.root
+        let node = this.root
 
         for (const char of word) {
-            if (!(char in curr.children)) {
-                curr.children[char] = new TrieNode()
+            if (!(char in node.children)) {
+                node.children[char] = new TrieNode()
             }
-
-            curr = curr.children[char]
+            node = node.children[char]
         }
 
-        curr.isWord = true
+        node.isWord = true
     }
 
     search(word) {
-        let curr = this.root
+        let node = this.root
 
         for (const char of word) {
-            if (!(char in curr.children)) {
+            if (!(char in node.children)) {
                 return false
             }
-
-            curr = curr.children[char]
+            node = node.children[char]
         }
 
-        return curr.isWord
+        return node.isWord
     }
 
     startsWith(prefix) {
-        let curr = this.root
+        let node = this.root
 
         for (const char of prefix) {
-            if (!(char in curr.children)) {
+            if (!(char in node.children)) {
                 return false
             }
-
-            curr = curr.children[char]
+            node = node.children[char]
         }
 
         return true

src/code/javascript/linked_list/reverse_linked_list.js

@@ -1,12 +1,12 @@
 const fn = (head) => {
-    let curr = head
     let prev = null
+    let curr = head
 
     while (curr) {
-        let nextNode = curr.next
+        let next = curr.next
         curr.next = prev
         prev = curr
-        curr = nextNode
+        curr = next
     }
 
     return prev

src/code/python/data_structures/trie.py

@@ -13,35 +13,32 @@ def build(self, words: list[str]) -> None:
             self.insert(word)
 
     def insert(self, word: str) -> None:
-        curr = self.root
+        node = self.root
 
         for char in word:
-            if char not in curr.children:
-                curr.children[char] = TrieNode()
+            if char not in node.children:
+                node.children[char] = TrieNode()
+            node = node.children[char]
 
-            curr = curr.children[char]
-
-        curr.is_word = True
+        node.is_word = True
 
     def search(self, word: str) -> bool:
-        curr = self.root
+        node = self.root
 
         for char in word:
-            if char not in curr.children:
+            if char not in node.children:
                 return False
+            node = node.children[char]
 
-            curr = curr.children[char]
-
-        return curr.is_word
+        return node.is_word
 
     def starts_with(self, prefix: str) -> bool:
-        curr = self.root
+        node = self.root
 
         for char in prefix:
-            if char not in curr.children:
+            if char not in node.children:
                 return False
-
-            curr = curr.children[char]
+            node = node.children[char]
 
         return True
 

src/code/python/linked_list/reverse_linked_list.py

@@ -1,11 +1,11 @@
 def fn(head):
-    curr = head
     prev = None
+    curr = head
 
     while curr:
-        next_node = curr.next
+        nxt = curr.next
         curr.next = prev
         prev = curr
-        curr = next_node
+        curr = nxt
 
     return prev