Merge pull request #3 from lomeli-noe/master

python solution to 1.1 and 1.2

Author: fvntr

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

@@ -0,0 +1,30 @@
+# Implement an algorithm to determine if a string has all unique charactersself.
+# What if you cannot use additional data structures.
+
+# For this problem I will assume we are working ASCII characters for which there
+# are 128 unique values.
+
+import array
+
+def isUnique(str):
+
+    # if the string is longer than 128 characters, it means there are duplicates
+    if len(str) > 128:
+        return false
+
+    # create an array to map the values
+    mask = array.array('i',(0,)*128)
+
+    for i in str:
+        # the first time we find a character we change the value at that index
+        # from 0 to 1
+        if mask[ord(i)] == 0:
+            mask[ord(i)] = 1
+        # if the value at that index is already 1, it means this is a duplicate
+        else:
+            return False
+    return True
+
+
+print("%s" % (isUnique("test")))
+print("%s" % (isUnique("abc123")))

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

@@ -0,0 +1,13 @@
+# Given two strings, write a method to decide if one is a permutation of the other
+
+def isPermutation(str1, str2):
+    if len(str1) != len(str2):
+        return False
+
+    sort1 = sorted(str1)
+    sort2 = sorted(str2)
+
+    return sort1 == sort2
+
+print("%s" % (isPermutation("stop", "pots")))
+print("%s" % (isPermutation("stops", "ponds")))