[Hacker Rank] Interview Preparation Kit: Dictionaries and Hashmaps: Sherlock and Anagrams. Clean Code: better variable naming.

Author: Gonzalo Diaz

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams.py

@@ -1,13 +1,14 @@
 # @link Problem definition
 # [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams.md]]
 
+from typing import Dict, List
 import math
 
 
 def sherlock_and_anagrams(s_word: str) -> int:
 
-    candidates = {}
-    size = len(s_word)
+    candidates: Dict[str, List[str]] = {}
+    size: int = len(s_word)
 
     # Calculate all substrings
     for i in range(0, size):
@@ -25,18 +26,18 @@ def sherlock_and_anagrams(s_word: str) -> int:
             else:
                 candidates[anagram_candidate] = [substr]
 
-    count = 0
+    count: int = 0
     # Final Anagram list
-    for i in list(candidates):
-        total = len(candidates[i])
+    for word in list(candidates):
+        quantity_of_anagrams = len(candidates[word])
         k = 2
 
-        if len(candidates[i]) <= 1:
-            del candidates[i]
+        if quantity_of_anagrams <= 1:
+            del candidates[word]
         else:
             # Binomial coefficient: https://en.wikipedia.org/wiki/Binomial_coefficient
-            count += math.factorial(total) // (
-                math.factorial(k) * math.factorial(total - k)
+            count += math.factorial(quantity_of_anagrams) // (
+                math.factorial(k) * math.factorial(quantity_of_anagrams - k)
             )
 
     print(f'filtered candidates: {count}')