Merge pull request #48 from lhchavez/unittest

This change standardizes all Python files so that they can run using
the unittest module.

Author: lhchavez

Python/chapter01/1.1 - Is Unique/camilo_sol.py renamed to Python/chapter01/1.1 - Is Unique/camilosalazar98.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/Q1.1.py renamed to Python/chapter01/1.1 - Is Unique/ismael_duran.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/lomeli_1.1.py renamed to Python/chapter01/1.1 - Is Unique/lomeli_noe.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/miguel_1.1_sol.py renamed to Python/chapter01/1.1 - Is Unique/miguelHx.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.1 - Is Unique/Nick1.py renamed to Python/chapter01/1.1 - Is Unique/nickolasteixeira.py

@@ -0,0 +1,24 @@
+import unittest
+
+
+def check_perm(example, example2):
+    for letter in example:
+        if letter in example2:
+            index = example2.index(letter)
+            example2 = example2[:index] + example2[index+1:]
+
+            if example2 == '':
+                return True
+            else:
+                continue
+        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.1 - Is Unique/solution.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/Q1.2.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()

Python/chapter01/1.2 - Check Perm/camilo_sol_1.2.py renamed to Python/chapter01/1.2 - Check Perm/camilosalazar98.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/ismael_duran.py

@@ -8,6 +8,9 @@
 Output: True (permutations: "taco cat", "atco eta", etc.)
 """
 
+import unittest
+
+
 def PalinPerm(str):
     d = {}
     str = str.replace(' ','').lower()#Take out the spaces
@@ -24,5 +27,11 @@ def PalinPerm(str):
             return False
     return True
 
-print(PalinPerm('taco cat'))#True
-print(PalinPerm('taco catt'))#False
+class Test(unittest.TestCase):
+    def test_palin_perm(self):
+        self.assertTrue(PalinPerm('taco cat'))
+        self.assertFalse(PalinPerm('taco catt'))
+
+
+if __name__ == '__main__':
+    unittest.main()

Python/chapter01/1.2 - Check Perm/lomeli_1.2.py renamed to Python/chapter01/1.2 - Check Perm/lomeli_noe.py

@@ -10,6 +10,9 @@
 Hints:#23, #97, #130
 """
 
+import unittest
+
+
 def oneAway(str1,str2):
     str1 = str1.lower()
     str2 = str2.lower()
@@ -47,7 +50,7 @@ def oneAway(str1,str2):
     replacing two letter will make v's count more onces
 
     You'll see this when you print k and v
-    
+
     """
     for k,v in d.items():
         #print(k,v)
@@ -61,15 +64,15 @@ def oneAway(str1,str2):
         return False
 
 
+class Test(unittest.TestCase):
+    def test_positive(self):
+        self.assertTrue(oneAway('pale', 'ple'))
+        self.assertTrue(oneAway('pales', 'pale'))
+        self.assertTrue(oneAway('pale', 'bale'))
 
+    def test_negative(self):
+        self.assertFalse(oneAway('pale', 'bake'))
 
 
-
-
-
-
-print(oneAway('pale', 'ple'))#True
-print(oneAway('pales', 'pale'))#True
-print(oneAway('pale', 'bale'))#True
-
-print(oneAway('pale', 'bake'))#False
+if __name__ == '__main__':
+    unittest.main()

Python/chapter01/1.2 - Check Perm/miguel_1.2_sol.py renamed to Python/chapter01/1.2 - Check Perm/miguelHx.py

@@ -7,6 +7,7 @@
 letters (a - z).
 """
 
+import unittest
 
 
 def string_compression(str1):
@@ -27,10 +28,9 @@ def string_compression(str1):
         return str1
 
 
+class Test(unittest.TestCase):
+    def test1(self):
+        self.assertEqual(string_compression('aabcccccaaa'), 'a2b1c5a3')
 
-
-
-
-
-
-print(string_compression('aabcccccaaa'))
+if __name__ == '__main__':
+    unittest.main()

Python/chapter01/1.2 - Check Perm/Nick2.py renamed to Python/chapter01/1.2 - Check Perm/nickolasteixeira.py

@@ -6,6 +6,8 @@
 
 """
 
+import unittest
+
 
 def rotate_matrix(matrix):
     matrix.reverse()# we frist reverse the matrix then we take its transpose
@@ -19,9 +21,12 @@ def rotate_matrix(matrix):
             matrix[j][i] = temp
 
 
-matrix = [[1,2,3],[4,5,6],[7,8,9]]
-rotate_matrix(matrix)
-#[[7, 4, 1], [8, 5, 2], [9, 6, 3]]
+class Test(unittest.TestCase):
+    def test_rotate_matrix(self):
+        matrix = [[1,2,3],[4,5,6],[7,8,9]]
+        rotate_matrix(matrix)
+        self.assertEqual(matrix, [[7, 4, 1], [8, 5, 2], [9, 6, 3]])
 
 
-print(matrix)
+if __name__ =='__main__':
+    unittest.main()

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

@@ -1,6 +1,8 @@
 #!/usr/bin/python3
+
 import random
-from pprint import pprint
+import unittest
+
 
 def build_matrix(w, h, max=10):
     '''function that builds a matrix with random numbers including 0'''
@@ -38,8 +40,23 @@ def rotate_matrix(matrix):
             # top right becomes top left
             matrix[i][last] = top
 
+
+class Test(unittest.TestCase):
+    def test_rotate_matrix(self):
+        matrix = [[8, 0, 5, 6, 8],
+                  [3, 4, 6, 6, 8],
+                  [3, 2, 10, 3, 0],
+                  [4, 3, 9, 0, 2],
+                  [9, 5, 4, 2, 10]]
+        rotate_matrix(matrix)
+        self.assertEqual(
+                matrix,
+                [[9, 4, 3, 3, 8],
+                 [5, 3, 2, 4, 0],
+                 [4, 9, 10, 6, 5],
+                 [2, 0, 3, 6, 6],
+                 [10, 2, 0, 8, 8]])
+
+
 if __name__ =='__main__':
-    matrix = build_matrix(5, 5)
-    pprint(matrix)
-    rotate_matrix(matrix)
-    pprint(matrix)
+    unittest.main()