Refactor variable names for clarity in encoding and anagram modules

Renamed variables in `encode_and_decode_strings.py` and `valid_anagram.py` to improve code readability and enhance semantic clarity. These updates ensure more intuitive understanding of function arguments and internal logic. No functional changes were introduced.

Author: nicholasadamou

Arrays & Hashing/encode_and_decode_strings.py

@@ -3,24 +3,24 @@
 import unittest
 from typing import List
 
-def encode(strs: List[str]) -> str:
+def encode(words: List[str]) -> str:
     encoded_words = []
 
-    for word in strs:
+    for word in words:
         encoded_word = str(len(word)) + "#" + word
         encoded_words.append(encoded_word)
 
     return ' '.join(encoded_words)
 
-def decode(s: str) -> List[str]:
-    n = len(s)
+def decode(encoded_words: str) -> List[str]:
+    n = len(encoded_words)
     decoded_words = []
     i = 0
 
     while i < n:
         j = i
         # Find the position of the next '#'
-        while j < n and s[j] != '#':
+        while j < n and encoded_words[j] != '#':
             j += 1
 
         # If no '#' is found, break the loop to avoid infinite loop
@@ -29,19 +29,19 @@ def decode(s: str) -> List[str]:
 
         # Try to convert the substring to an integer
         try:
-            length = int(s[i:j])
+            length = int(encoded_words[i:j])
         except ValueError:
-            raise ValueError(f"Invalid length found: {s[i:j]}")
+            raise ValueError(f"Invalid length found: {encoded_words[i:j]}")
 
         # Move i to the start of the actual word
         i = j + 1
         j = i + length
 
         # Check if the end of the word is within bounds
         if j > n:
-            raise ValueError(f"Word length {length} is out of bounds for the string: {s[i:]}")
+            raise ValueError(f"Word length {length} is out of bounds for the string: {encoded_words[i:]}")
 
-        decoded_word = s[i:j]
+        decoded_word = encoded_words[i:j]
         decoded_words.append(decoded_word)
 
         # Move i to the start of the next length

Arrays & Hashing/vaild_anagram.py

@@ -2,22 +2,22 @@
 
 import unittest
 
-def is_anagram(s: str, t: str) -> bool:
-    n = len(s)
-    m = len(t)
+def is_anagram(word_one: str, word_two: str) -> bool:
+    n = len(word_one)
+    m = len(word_two)
 
     if n != m:
         return False
 
     seen = {}
 
-    for char in s:
+    for char in word_one:
         if char in seen:
             seen[char] += 1
         else:
             seen[char] = 1
 
-    for char in t:
+    for char in word_two:
         if char in seen:
             seen[char] -= 1
         else: