Added testing for the fizzbuzz algorithm. (#833)

Author: ArnPellesGit

tests/test_strings.py

@@ -41,7 +41,8 @@
     atbash,
     longest_palindrome,
     knuth_morris_pratt,
-    panagram
+    panagram,
+    fizzbuzz
 )
 
 import unittest
@@ -662,6 +663,33 @@ def test_swedish_panagram(self):
         # Assert
         self.assertEqual(True, res)
 
-
+class TestFizzbuzz(unittest.TestCase):
+    """[summary]
+    Tests for the fizzbuzz method in file fizzbuzz.py
+    """
+    
+    def test_fizzbuzz(self):
+       # Testing that n < 0 returns a Value Error
+       self.assertRaises(ValueError, fizzbuzz.fizzbuzz, -2)
+
+       # Testing that a string returns a Type Error.
+       self.assertRaises(TypeError, fizzbuzz.fizzbuzz, "hello")
+
+       # Testing a base case, n = 3
+       result = fizzbuzz.fizzbuzz(3)
+       expected = [1, 2, "Fizz"]
+       self.assertEqual(result, expected)
+
+       # Testing a base case, n = 5
+       result = fizzbuzz.fizzbuzz(5)
+       expected = [1, 2, "Fizz", 4, "Buzz"]
+       self.assertEqual(result, expected)
+
+       # Testing a base case, n = 15 i.e. mod 3 and 5
+       result = fizzbuzz.fizzbuzz(15)
+       expected = [1, 2, "Fizz", 4, "Buzz", "Fizz", 7, 8, "Fizz", "Buzz", 11, 
+       "Fizz", 13, 14, "FizzBuzz"]
+       self.assertEqual(result, expected)
+        
 if __name__ == "__main__":
     unittest.main()