Merge pull request #541 from sir-gon/feature/sherlock_and_anagrams

Feature/sherlock and anagrams

Author: sir-gon

docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams.md

@@ -1,7 +1,7 @@
 # [Sherlock and Anagrams](https://www.hackerrank.com/challenges/mark-and-toys)
 
 - Difficulty:  `#medium`
-- Category: `#ProblemSolvingMedium`
+- Category: `#ProblemSolvingMedium` `#DictionariesAndHashmaps` `#Strings`
 
 Two strings are [http://en.wikipedia.org/wiki/Anagram](anagrams) of each other
 if the letters of one string can be rearranged to form the other string.

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams.json

@@ -0,0 +1,92 @@
+[
+  {
+    "title": "Sample Test Case 0",
+    "tests": [
+      {
+        "input": "abba",
+        "expected": 4
+      },
+      {
+        "input": "abcd",
+        "expected": 0
+      }
+    ]
+  },
+  {
+    "title": "Sample Test Case 1",
+    "tests": [
+      {
+        "input": "ifailuhkqq",
+        "expected": 3
+      },
+      {
+        "input": "kkkk",
+        "expected": 10
+      }
+    ]
+  },
+  {
+    "title": "Sample Test Case 1",
+    "tests": [
+      {
+        "input": "cdcd",
+        "expected": 5
+      }
+    ]
+  },
+  {
+    "title": "Test case 3",
+    "tests": [
+      {
+        "input":
+          "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
+        "expected": 166650
+      },
+      {
+        "input":
+          "bbcaadacaacbdddcdbddaddabcccdaaadcadcbddadababdaaabcccdcdaacadcababbabbdbacabbdcbbbbbddacdbbcdddbaaa",
+        "expected": 4832
+      },
+      {
+        "input":
+          "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
+        "expected": 166650
+      },
+      {
+        "input":
+          "cacccbbcaaccbaacbbbcaaaababcacbbababbaacabccccaaaacbcababcbaaaaaacbacbccabcabbaaacabccbabccabbabcbba",
+        "expected": 13022
+      },
+      {
+        "input":
+          "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
+        "expected": 166650
+      },
+      {
+        "input":
+          "bbcbacaabacacaaacbbcaabccacbaaaabbcaaaaaaaccaccabcacabbbbabbbbacaaccbabbccccaacccccabcabaacaabbcbaca",
+        "expected": 9644
+      },
+      {
+        "input":
+          "cbaacdbaadbabbdbbaabddbdabbbccbdaccdbbdacdcabdbacbcadbbbbacbdabddcaccbbacbcadcdcabaabdbaacdccbbabbbc",
+        "expected": 6346
+      },
+      {
+        "input":
+          "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
+        "expected": 166650
+      },
+      {
+        "input":
+          "babacaccaaabaaaaaaaccaaaccaaccabcbbbabccbbabababccaabcccacccaaabaccbccccbaacbcaacbcaaaaaaabacbcbbbcc",
+        "expected": 8640
+      },
+      {
+        "input":
+          "bcbabbaccacbacaacbbaccbcbccbaaaabbbcaccaacaccbabcbabccacbaabbaaaabbbcbbbbbaababacacbcaabbcbcbcabbaba",
+        "expected": 11577
+      }
+    ]
+  }
+]

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams.py

@@ -1,19 +1,25 @@
 # @link Problem definition
 # [[docs/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams.md]]
 
+from typing import Dict, List
 import math
 
+import logging
+
+LOGGER = logging.getLogger(__name__)
+
 
 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):
         for j in range(0, size - i):
             substr = s_word[i:size - j]
-            print(f'i: {i}, {size} size - j: {size - j} | substr: {substr}')
+            LOGGER.debug('i: %i, size: %i, size - j: %i | substr: %s',
+                         i, size, size - j, substr)
 
             # Add substrings to a candidate list.
             # two strings are anagrams if sorted strings are the same.
@@ -25,20 +31,20 @@ 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}')
+    LOGGER.debug('Sherlock_and_anagrams() Filtered candidates %i', count)
 
     return count

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams_test.py

@@ -1,48 +1,13 @@
 import unittest
+import json
+from pathlib import Path
 
 from .sherlock_and_anagrams import sherlock_and_anagrams
 
-
-TEST_CASES = [
-    {
-        'title': 'Sample Test Case 0',
-        'tests':
-        [
-            {
-                'input': 'abba',
-                'answer': 4
-            },
-            {
-                'input': 'abcd',
-                'answer': 0
-            }
-        ]
-    },
-    {
-        'title': 'Sample Test Case 1',
-        'tests':
-        [
-            {
-                'input': 'ifailuhkqq',
-                'answer': 3
-            },
-            {
-                'input': 'kkkk',
-                'answer': 10
-            }
-        ]
-    },
-    {
-        'title': 'Sample Test Case 1',
-        'tests':
-        [
-            {
-                'input': 'cdcd',
-                'answer': 5
-            }
-        ]
-    }
-]
+FILE_PATH = str(Path(__file__).resolve().parent)
+JSON_DATA_FILE = FILE_PATH + '/sherlock_and_anagrams.json'
+with open(JSON_DATA_FILE, encoding="utf-8") as file:
+    TEST_CASES = json.load(file)
 
 
 class TestSherlockAndAnagrams(unittest.TestCase):
@@ -54,6 +19,6 @@ def test_sherlock_and_anagrams(self):
             for _, _tt in enumerate(testset['tests']):
 
                 self.assertEqual(
-                    sherlock_and_anagrams(_tt['input']), _tt['answer'],
+                    sherlock_and_anagrams(_tt['input']), _tt['expected'],
                     f"{_} | sherlock_and_anagrams({_tt['input']}) must be "
-                    f"=> {_tt['answer']}")
+                    f"=> {_tt['expected']}")