[REFACTOR] Fixing naming convention for function names (to match with Hacker Rank interface).

Author: Gonzalo Diaz

docs/hackerrank/interview_preparation_kit/linked_lists/insert-a-node-into-a-sorted-doubly-linked-list.md

@@ -1,4 +1,4 @@
-# [Linked Lists: Insert a node at a specific position in a linked list](https://www.hackerrank.com/challenges/insert-a-node-at-a-specific-position-in-a-linked-list)
+# [Linked Lists: Insert a node at a specific position in a linked list](https://www.hackerrank.com/challenges/insert-a-node-into-a-sorted-doubly-linked-list)
 
 Create a node with a given value and insert it into a sorted doubly-linked list
 

src/hackerrank/interview_preparation_kit/arrays/cruch_bruteforce.py

@@ -6,7 +6,7 @@
 LOGGER = logging.getLogger(__name__)
 
 
-def array_manipulation(n_operations: int, queries: list[list[int]]) -> int:
+def arrayManipulation(n_operations: int, queries: list[list[int]]) -> int:
     result = [0] * (n_operations + 1)
     maximum = 0
 

src/hackerrank/interview_preparation_kit/arrays/cruch_bruteforce_test.py

@@ -2,7 +2,7 @@
 from pathlib import Path
 
 from ....hackerrank.lib.loader import load_test_cases
-from .cruch_bruteforce import array_manipulation
+from .cruch_bruteforce import arrayManipulation
 
 FILE_PATH = str(Path(__file__).resolve().parent)
 
@@ -17,6 +17,6 @@ def test_array_manipulation(self):
         for _, _tt in enumerate(CRUCH_SMALL_TEST_CASES):
 
             self.assertEqual(
-                array_manipulation(_tt['n'], _tt['queries']), _tt['expected'],
-                f"{_} | array_manipulation({_tt['n']}, {_tt['queries']}) must be "
+                arrayManipulation(_tt['n'], _tt['queries']), _tt['expected'],
+                f"{_} | arrayManipulation({_tt['n']}, {_tt['queries']}) must be "
                 f"=> {_tt['expected']}")

src/hackerrank/interview_preparation_kit/arrays/cruch_optimized.py

@@ -9,7 +9,7 @@
 LOGGER = logging.getLogger(__name__)
 
 
-def array_manipulation_optimized(n_operations: int, queries: list[list[int]]) -> int:
+def arrayManipulation(n_operations: int, queries: list[list[int]]) -> int:
     # why adding 2?
     #   first slot to adjust 1-based index and
     #   last slot for storing accum_sum result

src/hackerrank/interview_preparation_kit/arrays/cruch_optimized_test.py

@@ -2,7 +2,7 @@
 from pathlib import Path
 
 from ....hackerrank.lib.loader import load_test_cases
-from .cruch_optimized import array_manipulation_optimized
+from .cruch_optimized import arrayManipulation
 
 FILE_PATH = str(Path(__file__).resolve().parent)
 
@@ -17,6 +17,6 @@ def test_array_manipulation_optimized(self):
         for _, _tt in enumerate(CRUCH_SMALL_TEST_CASES):
 
             self.assertEqual(
-                array_manipulation_optimized(_tt['n'], _tt['queries']), _tt['expected'],
+                arrayManipulation(_tt['n'], _tt['queries']), _tt['expected'],
                 f"{_} | array_manipulation_optimized({_tt['n']}, {_tt['queries']}) "
                 f"must be => {_tt['expected']}")

src/hackerrank/interview_preparation_kit/arrays/ctci_array_left_rotation.py

@@ -7,20 +7,20 @@
 FIRST_POSITION: int = 0
 
 
-def rot_left_one(group: list[int]) -> list[int]:
+def rotLeftOne(group: list[int]) -> list[int]:
 
     first = group.pop(FIRST_POSITION)
     group.append(first)
 
     return group
 
 
-def rot_left(group: list[int], d_rotations: int) -> list[int]:
+def rotLeft(group: list[int], d_rotations: int) -> list[int]:
 
     output = group.copy()
     i = 1
     while i <= d_rotations:
-        output = rot_left_one(output)
+        output = rotLeftOne(output)
         i += 1
 
     return output

src/hackerrank/interview_preparation_kit/arrays/ctci_array_left_rotation_test.py

@@ -2,7 +2,7 @@
 from pathlib import Path
 
 from ....hackerrank.lib.loader import load_test_cases
-from .ctci_array_left_rotation import rot_left, rot_left_one
+from .ctci_array_left_rotation import rotLeft, rotLeftOne
 
 FILE_PATH = str(Path(__file__).resolve().parent)
 
@@ -16,8 +16,8 @@ def test_rot_left_one(self):
         for _, _tt in enumerate(TEST_CASES):
 
             self.assertEqual(
-                rot_left_one(_tt['input']), _tt['expected'],
-                f"{_} | rot_left({_tt['input']}) must be "
+                rotLeftOne(_tt['input']), _tt['expected'],
+                f"{_} | rotLeftOne({_tt['input']}) must be "
                 f"=> {_tt['expected']}")
 
     def test_rot_left(self):
@@ -29,6 +29,6 @@ def test_rot_left(self):
         for _, _tt in enumerate(tests):
 
             self.assertEqual(
-                rot_left(_tt['input'], _tt['d']), _tt['expected'],
-                f"{_} | rot_left({_tt['input']}) must be "
+                rotLeft(_tt['input'], _tt['d']), _tt['expected'],
+                f"{_} | rotLeft({_tt['input']}) must be "
                 f"=> {_tt['expected']}")

src/hackerrank/interview_preparation_kit/arrays/minimum_swaps_2.py

@@ -6,7 +6,7 @@
 LOGGER = logging.getLogger(__name__)
 
 
-def minimum_swaps(group: list[int]) -> int:
+def minimumSwaps(group: list[int]) -> int:
     indexed_group = [i - 1 for i in group]
 
     swaps = 0

src/hackerrank/interview_preparation_kit/arrays/minimum_swaps_2_test.py

@@ -2,7 +2,7 @@
 from pathlib import Path
 
 from ....hackerrank.lib.loader import load_test_cases
-from .minimum_swaps_2 import minimum_swaps
+from .minimum_swaps_2 import minimumSwaps
 
 FILE_PATH = str(Path(__file__).resolve().parent)
 
@@ -17,6 +17,6 @@ def test_minimum_swaps(self):
         for _, _tt in enumerate(TEST_CASES):
 
             self.assertEqual(
-                minimum_swaps(_tt['input']), _tt['expected'],
-                f"{_} | minimum_swaps({_tt['input']}) must be "
+                minimumSwaps(_tt['input']), _tt['expected'],
+                f"{_} | minimumSwaps({_tt['input']}) must be "
                 f"=> {_tt['expected']}")

src/hackerrank/interview_preparation_kit/arrays/new_year_chaos.py

@@ -4,11 +4,10 @@
 import logging
 
 LOGGER = logging.getLogger(__name__)
-
 TOO_CHAOTIC_ERROR = 'Too chaotic'
 
 
-def minimum_bribes(queue: list[int]) -> 'int | None':
+def minimumBribesCompute(queue: list[int]) -> 'int | None':
     bribes = 0
 
     for i, value in enumerate(queue):
@@ -24,10 +23,14 @@ def minimum_bribes(queue: list[int]) -> 'int | None':
     return bribes
 
 
-def minimum_bribes_transform(queue: list[int]) -> 'int | str':
+def minimumBribesText(queue: list[int]) -> 'int | str':
 
-    result = minimum_bribes(queue)
+    result = minimumBribesCompute(queue)
     if result is None:
         return TOO_CHAOTIC_ERROR
 
     return result
+
+
+def minimumBribes(queue: list[int]):
+    print(minimumBribesText(queue))

src/hackerrank/interview_preparation_kit/arrays/new_year_chaos_test.py

@@ -2,7 +2,7 @@
 from pathlib import Path
 
 from ....hackerrank.lib.loader import load_test_cases
-from .new_year_chaos import minimum_bribes_transform
+from .new_year_chaos import minimumBribes, minimumBribesText
 
 FILE_PATH = str(Path(__file__).resolve().parent)
 
@@ -17,6 +17,8 @@ def test_minimum_bribes(self):
         for _, _tt in enumerate(TEST_CASES):
 
             self.assertEqual(
-                minimum_bribes_transform(_tt['input']), _tt['expected'],
-                f"{_} | minimum_bribes_transform({_tt['input']}) must be "
+                minimumBribesText(_tt['input']), _tt['expected'],
+                f"{_} | minimumBribesText({_tt['input']}) must be "
                 f"=> {_tt['expected']}")
+
+            minimumBribes(_tt['input'])  # Print the result (for coverage)

src/hackerrank/interview_preparation_kit/arrays/two_d_array.py

@@ -25,7 +25,7 @@ def gethourglass(arr: list[list[int]], position_x: int, position_y: int) -> list
     return result
 
 
-def hourglass_sum(arr: list[list[int]]) -> int | None:
+def hourglassSum(arr: list[list[int]]) -> int | None:
     matrix_size: int = len(arr)
 
     matrix_start_index: int = 1

src/hackerrank/interview_preparation_kit/arrays/two_d_array_test.py

@@ -2,7 +2,7 @@
 from pathlib import Path
 
 from ....hackerrank.lib.loader import load_test_cases
-from .two_d_array import hourglass_sum
+from .two_d_array import hourglassSum
 
 FILE_PATH = str(Path(__file__).resolve().parent)
 
@@ -16,6 +16,6 @@ def test_hourglass_sum(self):
         for _, _tt in enumerate(TEST_CASES):
 
             self.assertEqual(
-                hourglass_sum(_tt['input']), _tt['expected'],
-                f"{_} | hourglass_sum({_tt['input']}) must be "
+                hourglassSum(_tt['input']), _tt['expected'],
+                f"{_} | hourglassSum({_tt['input']}) must be "
                 f"=> {_tt['expected']}")

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/count_triplets_1.py

@@ -4,7 +4,7 @@
 from collections import Counter
 
 
-def count_triplets_brute_force(arr: list[int], ratio: int) -> int:
+def countTripletsBruteForce(arr: list[int], ratio: int) -> int:
 
     size = len(arr)
     counter = 0
@@ -20,7 +20,7 @@ def count_triplets_brute_force(arr: list[int], ratio: int) -> int:
     return counter
 
 
-def count_triplets(arr: list[int], ratio: int) -> int:
+def countTriplets(arr: list[int], ratio: int) -> int:
     a_counter = Counter(arr)
     b_counter = Counter()
     triplets = 0

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/count_triplets_1_test.py

@@ -2,7 +2,7 @@
 from pathlib import Path
 
 from ....hackerrank.lib.loader import load_test_cases
-from .count_triplets_1 import count_triplets, count_triplets_brute_force
+from .count_triplets_1 import countTriplets, countTripletsBruteForce
 
 FILE_PATH = str(Path(__file__).resolve().parent)
 
@@ -19,7 +19,7 @@ def test_count_triplets_brute_force(self):
         for _, _tt in enumerate(SMALL_TEST_CASES):
 
             self.assertEqual(
-                count_triplets_brute_force(_tt['input'], _tt['r']), _tt['expected'],
+                countTripletsBruteForce(_tt['input'], _tt['r']), _tt['expected'],
                 f"{_} | count_triplets_brute_force({_tt['input']}, {_tt['r']}) must be "
                 f"=> {_tt['expected']}")
 
@@ -28,7 +28,7 @@ def test_count_triplets(self):
         for _, _tt in enumerate(SMALL_TEST_CASES):
 
             self.assertEqual(
-                count_triplets(_tt['input'], _tt['r']), _tt['expected'],
+                countTriplets(_tt['input'], _tt['r']), _tt['expected'],
                 f"{_} | count_triplets({_tt['input']}, {_tt['r']}) must be "
                 f"=> {_tt['expected']} in {_tt['title']}")
 
@@ -37,6 +37,6 @@ def test_count_triplets_big_cases(self):
         for _, _tt in enumerate(TEST_CASES_BIG):
 
             self.assertEqual(
-                count_triplets(_tt['input'], _tt['r']), _tt['expected'],
+                countTriplets(_tt['input'], _tt['r']), _tt['expected'],
                 f"{_} | count_triplets({_tt['input']}, {_tt['r']}) must be "
                 f"=> {_tt['expected']} in {_tt['title']}")

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/ctci_ransom_note.py

@@ -7,7 +7,7 @@
 __NO__ = 'No'
 
 
-def check_magazine_compute(magazine: List[str], note: List[str]) -> bool:
+def checkMagazineCompute(magazine: List[str], note: List[str]) -> bool:
     dictionary: Dict[str, int] = {}
 
     word: str
@@ -29,5 +29,9 @@ def check_magazine_compute(magazine: List[str], note: List[str]) -> bool:
     return True
 
 
-def check_magazine(magazine: List[str], note: List[str]) -> str:
-    return __YES__ if check_magazine_compute(magazine, note) else __NO__
+def checkMagazineText(magazine: List[str], note: List[str]) -> str:
+    return __YES__ if checkMagazineCompute(magazine, note) else __NO__
+
+
+def checkMagazine(magazine: List[str], note: List[str]):
+    print(checkMagazineText(magazine, note))

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/ctci_ransom_note_test.py

@@ -2,7 +2,7 @@
 from pathlib import Path
 
 from ....hackerrank.lib.loader import load_test_cases
-from .ctci_ransom_note import check_magazine
+from .ctci_ransom_note import checkMagazine, checkMagazineText
 
 FILE_PATH = str(Path(__file__).resolve().parent)
 
@@ -17,6 +17,9 @@ def test_check_magazine(self):
         for _, _tt in enumerate(TEST_CASES):
 
             self.assertEqual(
-                check_magazine(_tt['magazine'], _tt['note']), _tt['expected'],
-                f"{_} | check_magazine({_tt['magazine']}, {_tt['note']}) must be "
+                checkMagazineText(_tt['magazine'], _tt['note']), _tt['expected'],
+                f"{_} | checkMagazineText({_tt['magazine']}, {_tt['note']}) must be "
                 f"=> {_tt['expected']}")
+
+            # Print the result (for coverage)
+            checkMagazine(_tt['magazine'], _tt['note'])

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/frequency_queries.py

@@ -13,7 +13,7 @@
 __FOUND__ = 1
 
 
-def freq_query(queries):
+def freqQuery(queries):
     result = []
     data_map: Dict[int, int] = {}
 

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/frequency_queries_test.py

@@ -2,7 +2,7 @@
 from pathlib import Path
 
 from ....hackerrank.lib.loader import load_test_cases
-from .frequency_queries import freq_query
+from .frequency_queries import freqQuery
 
 FILE_PATH = str(Path(__file__).resolve().parent)
 
@@ -17,12 +17,12 @@ def test_freq_query(self):
         for _, _tt in enumerate(TEST_CASES):
 
             self.assertEqual(
-                freq_query(_tt['input']), _tt['expected'],
-                f"{_} | freq_query({_tt['input']}) must be "
+                freqQuery(_tt['input']), _tt['expected'],
+                f"{_} | freqQuery({_tt['input']}) must be "
                 f"=> {_tt['expected']}")
 
     def test_freq_query_edge_case(self):
 
         self.assertRaisesRegex(ValueError,
                                'Invalid operation',
-                               freq_query, [[4, 1]])
+                               freqQuery, [[4, 1]])

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams.py

@@ -9,7 +9,7 @@
 LOGGER = logging.getLogger(__name__)
 
 
-def sherlock_and_anagrams(s_word: str) -> int:
+def sherlockAndAnagrams(s_word: str) -> int:
 
     candidates: Dict[str, List[str]] = {}
     size: int = len(s_word)

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/sherlock_and_anagrams_test.py

@@ -2,7 +2,7 @@
 import json
 from pathlib import Path
 
-from .sherlock_and_anagrams import sherlock_and_anagrams
+from .sherlock_and_anagrams import sherlockAndAnagrams
 
 FILE_PATH = str(Path(__file__).resolve().parent)
 JSON_DATA_FILE = FILE_PATH + '/sherlock_and_anagrams.json'
@@ -19,6 +19,6 @@ def test_sherlock_and_anagrams(self):
             for _, _tt in enumerate(testset['tests']):
 
                 self.assertEqual(
-                    sherlock_and_anagrams(_tt['input']), _tt['expected'],
+                    sherlockAndAnagrams(_tt['input']), _tt['expected'],
                     f"{_} | sherlock_and_anagrams({_tt['input']}) must be "
                     f"=> {_tt['expected']}")

src/hackerrank/interview_preparation_kit/dictionaries_and_hashmaps/two_strings.py

@@ -5,13 +5,13 @@
 __NO__ = 'No'
 
 
-def two_strings_compute(s1_word: str, s2_word: str) -> bool:
+def twoStringsCompute(s1_word: str, s2_word: str) -> bool:
     for letter in s1_word:
         if letter in s2_word:
             return True
 
     return False
 
 
-def two_strings(s1_word: str, s2_word: str) -> str:
-    return __YES__ if two_strings_compute(s1_word, s2_word) else __NO__
+def twoStrings(s1_word: str, s2_word: str) -> str:
+    return __YES__ if twoStringsCompute(s1_word, s2_word) else __NO__