Merge pull request #6 from nickolasteixeira/nick

Nick

Author: fvntr

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

@@ -0,0 +1,67 @@
+#!/usr/bin/python3
+'''
+Module that implements an algorithm to determine if a string has all unique characters. What if you
+cannot use additional data structures?
+'''
+
+import unittest
+
+def unique(string):
+    '''checks if string input is unique
+    Args:
+        string (str): string to check
+    '''
+    return len(set(string)) is len(string)
+
+def unique2(string):
+    '''checks if string input is unique
+    args:
+        string (str): string to check
+    '''
+    letters = {}
+    for letter in string:
+        letters[letter] = letters.get(letter, 0) + 1
+        if letters.get(letter) is not None and letters[letter] > 1:
+                return False
+    return True
+
+def unique3(string):
+    '''checks if string input is unique, no new data structures
+    args:
+        string (str): string to check
+    '''
+    new_string = sorted(string)
+    for idx in range(len(new_string) - 1):
+        if new_string[idx] == new_string[idx + 1]:
+            return False
+
+    return True
+
+
+class Test(unittest.TestCase):
+    def test1(self):
+        all_true = ["Nick", "world"]
+        all_false = ["eee", "hello"]
+
+        for idx in range(len(all_true)):
+            self.assertTrue(unique(all_true[idx]))
+            self.assertFalse(unique(all_false[idx]))
+
+    def test2(self):
+        all_true = ["Nick", "world", "Sue", "John", "abcdefghijklmnopqrstuvwxyz"]
+        all_false = ["eee", "hello", "nicki", "johnny", "suuu"]
+
+        for idx in range(len(all_true)):
+            self.assertTrue(unique2(all_true[idx]))
+            self.assertFalse(unique2(all_false[idx]))
+
+    def test3(self):
+        all_true = ["Nick", "world", "Sue", "John", "abcdefghijklmnopqrstuvwxyz"]
+        all_false = ["eee", "hello", "nicki", "johnny", "suuu"]
+
+        for idx in range(len(all_true)):
+            self.assertTrue(unique3(all_true[idx]))
+            self.assertFalse(unique3(all_false[idx]))
+
+if __name__ == '__main__':
+    unittest.main()

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

@@ -0,0 +1,65 @@
+#!/usr/bin/python3
+'''
+Module that Given two strings, write a method to decide if one is a permutation of the
+other. 
+
+'''
+
+import unittest
+
+def permutation(string1, string2):
+    '''
+    Checks two strings if one is a permutation of the other
+    Args:
+        string1 (str): a string
+        string2 (str): another string
+    '''
+    if len(string1) is not len(string2):
+        return False
+
+    n1, n2 = sorted(string1), sorted(string2)
+    return n1 == n2 
+
+def permutation2(string1, string2):
+    '''
+    Checks two strings if one is a permutation of the other
+    Args:
+        string1 (str): a string
+        string2 (str): another string
+    '''
+    if len(string1) is not len(string2):
+        return False
+
+    d1, d2 = {}, {}
+    for idx in range(len(string1)):
+        d1[string1[idx]] = d1.get(string1[idx], 0) + 1
+        d2[string2[idx]] = d2.get(string2[idx], 0) + 1
+
+    return d1 == d2
+
+def permutation3(string1, string2):
+    '''
+    Checks two strings if one is a permutation of the other
+    Args:
+        string1 (str): a string
+        string2 (str): another string
+    '''
+
+
+class Test(unittest.TestCase):
+    def test1(self):
+        t1 = "nickiiii"
+        t2 = "iiiiinck"
+        x1, x2 = "hello", "world"
+        self.assertTrue(permutation(t1,t2))
+        self.assertFalse(permutation(x1, x2))
+
+    def test2(self):
+        self.assertFalse(permutation2("nickjjj", "nickkki"))
+        self.assertTrue(permutation2("iiiiinn", "nniiiii"))
+
+    def test3(self):
+        pass
+
+if __name__ == '__main__':
+    unittest.main()

Python/chapter01/1.3 - URLify/Nick3.py

@@ -0,0 +1,28 @@
+#!/usr/bin/python3
+'''
+Module that Write a method to replace all spaces in a string with '%20'. You may assume that the string
+has sufficient space at the end to hold the additional characters, and that you are given the "true"
+length of the string. (Note: If implementing in Java, please use a character array so that you can
+perform this operation in place.) 
+'''
+
+import unittest
+
+def URLify(string, char):
+    '''
+    Function that replace all spaces in a string with '%20'. 
+    Args:
+        string (str): a string to modify
+    '''
+    return string[:char + 1].replace(" ", "%20")    
+
+class Test(unittest.TestCase):
+    def test1(self):
+        input_string = "Mr Johns Smith      "
+        char = 13
+        output_string = "Mr%20John%20Smith"
+       
+        self.assertTrue(URLify(input_string, 13), output_string)
+ 
+if __name__ == '__main__':
+    unittest.main()

Python/chapter01/1.4 - PalinPerm/Nick4.py

@@ -0,0 +1,42 @@
+#!/usr/bin/python3
+'''
+Palindrome Permutation: Given a string, write a function to check if it is a permutation of a palindrome.
+A palindrome is a word or phrase that is the same forwards and backwards. A permutation
+is a rearrangement of letters. The palindrome does not need to be limited to just dictionary words
+'''
+
+import unittest
+
+
+def palperm(string):
+    '''
+    Function that checks if it is a permutation of a palindrome
+    Args:
+        string (str): a string to check for all palindrome permutations
+    '''
+    table = {}
+    count = 0
+    for letter in string.lower().replace(" ", ""):
+        table[letter] = table.get(letter, 0) + 1
+
+    for key in table:
+        if count > 1:
+            return False
+        if table[key] % 2 == 1:
+            count += 1
+    return True
+
+
+class Test(unittest.TestCase):
+    def test1(self):
+        input_string ="Tact Coa"
+        input_string2 ="nick"
+        input_string3 ="saippuakivikauppias"
+        input_string4 = "iasppaukivikauppias"
+        self.assertTrue(palperm(input_string))
+        self.assertFalse(palperm(input_string2))
+        self.assertTrue(palperm(input_string3))
+        self.assertTrue(palperm(input_string4))
+
+if __name__ == '__main__':
+    unittest.main()