Cleaned Up Challenge Code (#57)

* Reworking solutions files

* Reworking solutions

* Updated duplicates solutions

* Added rounding solutions

* Created cat function

* Cleaned up existence

* Created init files for testing purposes

* Renamed files

* Renamed all solutions files

* Removed module file

Author: jrg94

challenges/how-to-capitalize-a-string/solutions.py renamed to challenges/how-to-capitalize-a-string/capitalize.py

@@ -1,17 +1,17 @@
-import solutions
+import capitalize
 from inspect import getmembers, isfunction
 
 
 def test_capitalize_all_lowercase():
-    for _, value in getmembers(solutions, isfunction):
+    for _, value in getmembers(capitalize, isfunction):
         assert value("deku") == "Deku"
 
 
 def test_capitalize_no_alphabet():
-    for _, value in getmembers(solutions, isfunction):
+    for _, value in getmembers(capitalize, isfunction):
         assert value("1234") == "1234"
 
 
 def test_capitalize_all_caps():
-    for _, value in getmembers(solutions, isfunction):
+    for _, value in getmembers(capitalize, isfunction):
         assert value("TSUYU") == "Tsuyu"

challenges/how-to-capitalize-a-string/test_solutions.py renamed to challenges/how-to-capitalize-a-string/test_capitalize.py

@@ -2,9 +2,10 @@
 Provides a series of solutions to the challenge provided at the following link:
 https://therenegadecoder.com/code/how-to-check-if-a-key-exists-in-a-dictionary-in-python/#challenge
 """
+from typing import Optional
 
 
-def case_insensitive_lookup_1(dictionary: dict, term: str):
+def case_insensitive_lookup_1(dictionary: dict, term: str) -> Optional[str]:
     """
     Implements a case insensitive lookup using a try/catch.
 
@@ -16,11 +17,11 @@ def case_insensitive_lookup_1(dictionary: dict, term: str):
     key = term.lower()
     try:
         return dictionary[key.lower()]
-    except:
+    except KeyError:
         return None
 
 
-def case_insensitive_lookup_2(dictionary: dict, term: str):
+def case_insensitive_lookup_2(dictionary: dict, term: str) -> Optional[str]:
     """
     Implements a case insensitive lookup using the get() method.
 

challenges/how-to-check-if-a-key-exists-in-a-dictionary/solutions.py renamed to challenges/how-to-check-if-a-key-exists-in-a-dictionary/case_insensitive_lookup.py

@@ -0,0 +1,10 @@
+import case_insensitive_lookup
+from inspect import getmembers, isfunction
+
+
+def test_case_insensitive_lookup_capital():
+    dictionary = {
+        "shrub": "a woody plant which is smaller than a tree and has several main stems arising at or near the ground."
+    }
+    for _, value in getmembers(case_insensitive_lookup, isfunction):
+        assert value(dictionary, "Shrub") == dictionary["shrub"]

challenges/how-to-check-if-a-key-exists-in-a-dictionary/test_case_insensitive_lookup.py

@@ -1,5 +1,5 @@
 """
-Provides a series of solutions to the challenge provided at the following link:
+
 https://therenegadecoder.com/code/how-to-compute-absolute-value-in-python/#challenge
 """
 

challenges/how-to-check-if-a-string-contains-a-substring/solutions.py renamed to challenges/how-to-check-if-a-string-contains-a-substring/search.py

@@ -0,0 +1,33 @@
+"""
+Provides a series of solutions to the challenge provided at the following link:
+https://therenegadecoder.com/code/how-to-create-a-list-in-python/#challenge
+"""
+
+
+def fib_1():
+    fibonacci = [1, 1]
+    [fibonacci.append(fibonacci[i - 1] + fibonacci[i - 2]) for i in range(2, 100)]
+    return fibonacci
+
+
+def fib_2():
+    series = [1, 1]
+    for i in range(2, 100):
+        prev_1 = series[i - 1]
+        prev_2 = series[i - 2]
+        new = prev_1 + prev_2
+        series.append(new)
+    return series
+
+
+def fib_3():
+    def recur(n):
+        if n == 0 or n == 1:
+            return 1
+        else:
+            return recur(n - 1) + recur(n - 2)
+    series = []
+    for i in range(100):
+        number = recur(i)
+        series.append(number)
+    return series