Standardize python's unittests

This change makes all the Python solutions use unittest and run
silently.

Author: lhchavez

Python/chapter01/1.1 - Is Unique/Q1.1.py

@@ -1,3 +1,4 @@
+import unittest
 
 # Note that this solution assumes a unique string
 # implies a lowercase letter and the uppercase of
@@ -15,13 +16,18 @@ def uniqueChar(passedStr):
 
         # If the string had unique characters the string
         # length remains the same
-        # If the string has duplicates then size 
+        # If the string has duplicates then size
         if len(deleteDuplicateIfAny) == len(passedStr):
                 return "Unique"
         else:
                 return "Not Unique"
 
 
-example = "Helloh"
+class Test(unittest.TestCase):
+    def test_uniqueChar(self):
+        example = "Helloh"
+        self.assertEqual(uniqueChar(example), "Not Unique")
 
-print(uniqueChar(example))
+
+if __name__ == '__main__':
+    unittest.main()

Python/chapter01/1.1 - Is Unique/camilo_sol.py

@@ -3,6 +3,9 @@
 characters. What if you cannot use additional data structures?
 """
 
+import unittest
+
+#This soluation is O(n^2)
 
 def isUnique(string_):
     for i in range(len(string_)):
@@ -12,8 +15,6 @@ def isUnique(string_):
                 return False
     return True
 
-print(isUnique("GeeksforGeeks"))
-#This soluation is O(n^2)
 
 #let's see if we can go faster
 
@@ -30,4 +31,14 @@ def isUnique_(string_):
             return False
     return True
 
-print(isUnique_("camilo"))
+
+class Test(unittest.TestCase):
+    def test_quadradic(self):
+        self.assertFalse(isUnique("GeeksforGeeks"))
+
+    def test_linear(self):
+        self.assertTrue(isUnique_("camilo"))
+
+
+if __name__ == '__main__':
+    unittest.main()

Python/chapter01/1.1 - Is Unique/lomeli_1.1.py

@@ -5,6 +5,7 @@
 # are 128 unique values.
 
 import array
+import unittest
 
 def isUnique(str):
 
@@ -26,5 +27,11 @@ def isUnique(str):
     return True
 
 
-print("%s" % (isUnique("test")))
-print("%s" % (isUnique("abc123")))
+class Test(unittest.TestCase):
+    def test_is_unique(self):
+        self.assertFalse(isUnique("test"))
+        self.assertTrue(isUnique("abc123"))
+
+
+if __name__ == '__main__':
+    unittest.main()

Python/chapter01/1.1 - Is Unique/solution.py

@@ -1,18 +1,24 @@
-example = "hello"
-example2 = "ehloe"
+import unittest
 
-for letter in example:
-    if letter in example2:
+
+def check_perm(example, example2):
+    for letter in example:
+        if letter in example2:
             index = example2.index(letter)
             example2 = example2[:index] + example2[index+1:]
-            print(example2)
 
             if example2 == '':
-                print("done with permutation")
-                break
+                return True
             else:
                 continue
-    else:
-        print("Not permutatable")
-        break
-        
+        else:
+            return False
+
+
+class Test(unittest.TestCase):
+    def test_perm_check(self):
+        self.assertFalse(check_perm("hello", "ehloe"))
+
+
+if __name__ == '__main__':
+    unittest.main()

Python/chapter01/1.2 - Check Perm/Q1.2.py

@@ -3,9 +3,10 @@
 one is a permutation of the other.
 """
 
+import unittest
 
 
-
+#O(n) sol?
 def perm_check(str_1,str_2):
     if len(str_1) != len(str_2):#If both str are diiferent lenghts return false
         return False
@@ -29,9 +30,12 @@ def perm_check(str_1,str_2):
     return True
 
 
-#O(n) sol?
-print(perm_check("camilo","pop")) #False
+class Test(unittest.TestCase):
+    def test_perm_check(self):
+        self.assertFalse(perm_check("camilo","pop"))
+        self.assertFalse(perm_check("camilo","camplo"))
+        self.assertTrue(perm_check("camilo","olimac"))
 
-print(perm_check("camilo","camplo")) #false
 
-print(perm_check("camilo","olimac")) #True
+if __name__ == '__main__':
+    unittest.main()

Python/chapter01/1.2 - Check Perm/camilo_sol_1.2.py

@@ -1,5 +1,7 @@
 # Given two strings, write a method to decide if one is a permutation of the other
 
+import unittest
+
 def isPermutation(str1, str2):
     if len(str1) != len(str2):
         return False
@@ -9,5 +11,12 @@ def isPermutation(str1, str2):
 
     return sort1 == sort2
 
-print("%s" % (isPermutation("stop", "pots")))
-print("%s" % (isPermutation("stops", "ponds")))
+
+class Test(unittest.TestCase):
+    def test_perm_check(self):
+        self.assertTrue(isPermutation("stop", "pots"))
+        self.assertFalse(isPermutation("stops", "ponds"))
+
+
+if __name__ == '__main__':
+    unittest.main()

Python/chapter01/1.2 - Check Perm/lomeli_1.2.py

@@ -1,3 +1,4 @@
+import unittest
 
 
 def replaceSpace(stringPas, totalLen):
@@ -13,4 +14,10 @@ def replaceSpace(stringPas, totalLen):
     else:
         return newString
 
-print(replaceSpace("Hi, how is your  ",18))
+class Test(unittest.TestCase):
+    def test_perm_check(self):
+        self.assertEqual(replaceSpace("Hi, how is your  ",18), "Fail")
+
+
+if __name__ == '__main__':
+    unittest.main()

Python/chapter01/1.2 - Check Perm/solution.py

@@ -8,6 +8,9 @@
 Input: "Mr John Smith   ", 13 Output: "Mr%20John%20Smith"
 """
 
+import unittest
+
+
 def urlify(str):
     len_ = len(str) #gets the lenght of str
     new_str = ""#build a new string
@@ -22,4 +25,11 @@ def urlify(str):
 
     return new_str
 
-print(urlify("MY house is on fire "))
+class Test(unittest.TestCase):
+    def test_perm_check(self):
+        self.assertEqual(urlify("MY house is on fire "),
+                         "MY%20house%20is%20on%20fire")
+
+
+if __name__ == '__main__':
+    unittest.main()