Merge pull request #734 from sir-gon/develop

sir-gon · web-flow · commit 6394bdfa30b6 · 2025-07-13T13:56:58.000-04:00
[REFACTOR] sonarcloud fixes.
diff --git a/src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams.py b/src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams.py
@@ -34,13 +34,12 @@ def sherlockAndAnagrams(s_word: str) -> int:
     total: int = 0
     q_candidates = 0
     # Final Anagram list
-    for word in list(candidates):
-        quantity_of_anagrams = len(candidates[word])
+
+    for word, candidates_of in candidates.items():
+        quantity_of_anagrams = len(candidates_of)
         k = 2
 
-        if quantity_of_anagrams <= 1:
-            del candidates[word]
-        else:
+        if quantity_of_anagrams > 1:
             # Binomial coefficient: https://en.wikipedia.org/wiki/Binomial_coefficient
             q_candidates += quantity_of_anagrams
 
diff --git a/src/hackerrank/interview_preparation_kit/search/swap_nodes_algo.py b/src/hackerrank/interview_preparation_kit/search/swap_nodes_algo.py
@@ -79,7 +79,7 @@ def buildTree(indexes: List[List[int]]) -> Node:
             __INITIAL_LEVEL__,
             callbackCollectNodes)
 
-        last_level: int = sorted(list(node_collector))[-1]
+        last_level: int = sorted(node_collector)[-1]
 
         for i in range(0, min(len(indexes_copy), len(node_collector[last_level]))):
             current_node: Node = node_collector[last_level][i]
diff --git a/src/projecteuler/helpers/word_score.py b/src/projecteuler/helpers/word_score.py
@@ -31,7 +31,7 @@
 def wordScore(word: str) -> int:
     result = 0
 
-    for letter in list(word):
+    for letter in word:
         if letter in _scoreLetter:
             result += _scoreLetter[letter]
 
