Add automated tests

Author: r1cc4rdo

legacy2.7/README.md legacy/README.md

@@ -15,11 +15,11 @@ def coding_problem_01(stack):
     Note: with Python lists, you could instead islice(chain.from_iterable(izip(l, reversed(l))), len(l))
     """
     queue = deque([])  # stack S:[1,2,3,4,5], queue Q:[]
-    for cnt in xrange(len(stack) - 1):  # move stack into queue. S:[1], Q:[5,4,3,2]
+    for cnt in range(len(stack) - 1):  # move stack into queue. S:[1], Q:[5,4,3,2]
         queue.append(stack.pop())
-    for cnt in xrange(len(queue) / 2):
+    for cnt in range(len(queue) // 2):
         stack.append(queue.popleft())  # S:[1,5], Q:[4,3,2]
-        for cnt2 in xrange(len(queue) - 1):  # rotate last element to front, S:[1,5], Q:[2,4,3]
+        for cnt2 in range(len(queue) - 1):  # rotate last element to front, S:[1,5], Q:[2,4,3]
             queue.append(queue.popleft())
         stack.append(queue.popleft())  # S:[1,5,2], Q:[4,3]
     if queue:
@@ -39,7 +39,7 @@ def coding_problem_02(l):
     """
     forward = [1] * len(l)
     backward = [1] * len(l)
-    for idx in xrange(1, len(l)):
+    for idx in range(1, len(l)):
 
         forward[idx] = forward[idx - 1] * l[idx - 1]
         backward[-idx - 1] = backward[-idx] * l[-idx]

legacy2.7/daily_coding_problem_01_05.py legacy/daily_coding_problem_01_05.py

@@ -7,7 +7,7 @@ def coding_problem_06():
     Example:
 
     >>> l = coding_problem_06()
-    >>> for cnt in xrange(0, 4):
+    >>> for cnt in range(0, 4):
     ...     l.add(cnt)
     >>> l.get(2) == 2
     True
@@ -51,7 +51,7 @@ def add(self, val):
 
         def get(self, index):
             current_index, previous_index, current_node = self.head()
-            for cnt in xrange(index + 1):
+            for cnt in range(index + 1):
                 previous_index, current_index = current_index, current_node.next_node(previous_index)
                 current_node = self.memory[current_index]
             return current_node.val
@@ -147,14 +147,14 @@ def delayed_execution(f, ms):
         return f()
 
     def hello(name):
-        print 'Hello {}'.format(name)
+        print('Hello {}'.format(name))
 
     job = Thread(target=delayed_execution, args=(lambda: hello('from thread'), 0.01))
     job.start()
 
-    print 'Before'
+    print('Before')
     time.sleep(0.02)
-    print 'After'
+    print('After')
 
 
 if __name__ == '__main__':

legacy2.7/daily_coding_problem_06_10.py legacy/daily_coding_problem_06_10.py

@@ -108,7 +108,7 @@ def coding_problem_14():
     pi_approx = 3.0  # physicist $/pi$
     while True:
 
-        for cnt in xrange(10000):
+        for cnt in range(10000):
 
             inside += math.hypot(random.random(), random.random()) <= 1
 
@@ -128,12 +128,12 @@ def coding_problem_15(sample_generator):
     >>> random.seed(0xBADC0FFE)
     >>>
     >>> def sample_gen_fun(n):
-    ...     for x in xrange(n):
+    ...     for x in range(n):
     ...         yield x
     >>>
     >>> num = 10
     >>> hist = [0] * num
-    >>> for trials in xrange(5000):
+    >>> for trials in range(5000):
     ...
     ...     hist[coding_problem_15(sample_gen_fun(num))] += 1
     >>>

legacy2.7/daily_coding_problem_11_15.py legacy/daily_coding_problem_11_15.py

@@ -10,7 +10,7 @@ def coding_problem_16(length):
     Example:
 
     >>> log = coding_problem_16(10)
-    >>> for id in xrange(20):
+    >>> for id in range(20):
     ...     log.record(id)
 
     >>> log.get_last(0)
@@ -156,7 +156,7 @@ def coding_problem_18(arr, k):
     >>> coding_problem_18([10, 5, 2, 7, 8, 7], 3)
     [10, 7, 8, 8]
     """
-    for cnt in xrange(k - 1):
+    for cnt in range(k - 1):
         arr = [max(value, other) for value, other in zip(arr[:-1], arr[1:])]
 
     return arr
@@ -170,7 +170,7 @@ def coding_problem_19(costs):
     """
     best_cost = [0] * len(costs[0])
     for cost in costs:  # add a house at a time
-        for index in xrange(len(cost)):  # best cost is the one for that color plus min cost between every other color
+        for index in range(len(cost)):  # best cost is the one for that color plus min cost between every other color
             best_cost[index] = cost[index] + min(best_cost[:index] + best_cost[index + 1:])
 
     return min(best_cost)
@@ -215,10 +215,10 @@ def coding_problem_20(list_a, list_b):
     if len_b > len_a:
         list_a, list_b = list_b, list_a
 
-    for advance in xrange(abs(len_a - len_b)):
+    for advance in range(abs(len_a - len_b)):
         list_a = list_a.next
 
-    for check in xrange(len_b):
+    for check in range(len_b):
         if list_a is list_b:
             return list_a.value
 

legacy2.7/daily_coding_problem_16_20.py legacy/daily_coding_problem_16_20.py

@@ -66,16 +66,16 @@ def coding_problem_23(matrix, start, end):
 
     >>> map = [[False, False, False, False], [True, True, False, True],
     ...        [False, False, False, False], [False, False, False, False]]
-    >>> coding_problem_23(matrix, (3, 0), (0, 0))
+    >>> coding_problem_23(map, (3, 0), (0, 0))
     7
     >>> map[1][2] = True  # close off path
-    >>> coding_problem_23(matrix, (3, 0), (0, 0))  # None
+    >>> coding_problem_23(map, (3, 0), (0, 0))  # None
     """
     coords = [(index_r, index_c) for index_r, row in enumerate(matrix)
               for index_c, element in enumerate(row) if not element]
 
     current_distance = 0
-    distances = [[None for col in xrange(len(matrix[0]))] for row in xrange(len(matrix))]
+    distances = [[None for col in range(len(matrix[0]))] for row in range(len(matrix))]
     distances[start[0]][start[1]] = 0
     while True:
 
@@ -177,7 +177,7 @@ def coding_problem_25(rexp, string):
 
         if len(rexp) >= 2 and rexp[1] == '*':
 
-            for cnt in xrange(len(string)):
+            for cnt in range(len(string)):
                 if coding_problem_25(''.join([rexp[0]] * cnt) + rexp[2:], string):
                     return True
 

legacy2.7/daily_coding_problem_21_25.py legacy/daily_coding_problem_21_25.py

@@ -1,3 +1,14 @@
+try:
+    from future.utils import implements_iterator
+except ImportError:
+    pass
+
+try:
+    from functools import reduce
+except ImportError:
+    pass
+
+
 def coding_problem_26(not_a_linked_list, k):
     """
     Given a singly linked list and an integer k, remove the kth last element from the list. k is guaranteed to be
@@ -15,19 +26,19 @@ def coding_problem_26(not_a_linked_list, k):
     k-buffer of the stream, would not be constant space. If you're reading this and have better ideas, let me know!
     """
     iter_to_the_end = iter(not_a_linked_list)
-    for _ in xrange(k):
-        iter_to_the_end.next()  # k is guaranteed < len(list)
+    for _ in range(k):
+        next(iter_to_the_end)  # k is guaranteed < len(list)
 
     result = []
     iter_lagging_behind = iter(not_a_linked_list)
     while True:
-        result.append(iter_lagging_behind.next())
+        result.append(next(iter_lagging_behind))
         try:
-            iter_to_the_end.next()
+            next(iter_to_the_end)
         except StopIteration:
             break
 
-    iter_lagging_behind.next()  # gobble an element
+    next(iter_lagging_behind)  # gobble an element
     result.extend(iter_lagging_behind)
     return result
 

legacy2.7/daily_coding_problem_26_30.py legacy/daily_coding_problem_26_30.py

@@ -58,7 +58,7 @@ def coding_problem_32(exchange_matrix):
     Since floating point quantities are involved, we need to test for approximate equality.
     """
     em = np.array(exchange_matrix)  # ideally, we should test if the exchange_matrix is well-formed
-    cem = np.vstack(em[0, :] / em[0, n] for n in range(len(em)))  # computed exchange_matrix
+    cem = np.vstack([em[0, :] / em[0, n] for n in range(len(em))])  # computed exchange_matrix
     return np.allclose(em, cem)
 
 

legacy2.7/daily_coding_problem_31_35.py legacy/daily_coding_problem_31_35.py

@@ -25,7 +25,7 @@ def coding_problem_37(s):
     The power set of a set is the set of all its subsets. Write a function that, given a set, generates its power set.
     You may also use a list or array to represent a set. Example:
 
-    >>> sorted([sorted(subset) for subset in coding_problem_37({1, 2, 3})], cmp=lambda a, b: cmp(len(a), len(b)))
+    >>> sorted([sorted(subset) for subset in coding_problem_37({1, 2, 3})], key=len)
     [[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1, 2, 3]]
     """
     power_set = [[]]
@@ -82,7 +82,7 @@ def coding_problem_39(cells):
 
     >>> gol = coding_problem_39(((0, 1), (1, 2), (2, 0), (2, 1), (2, 2)))
     >>> for _ in range(5):
-    ...     print gol
+    ...     print(gol)
     ...     gol.simulate()
     ..*
     *.*

legacy2.7/daily_coding_problem_36_40.py legacy/daily_coding_problem_36_40.py

@@ -21,7 +21,7 @@ def coding_problem_41(flights_db, starting_airport):
         return [starting_airport]
 
     legs = [leg for leg in flights_db if leg[0] == starting_airport]
-    for leg in sorted(legs, cmp=lambda la, lb: cmp(la[1], lb[1])):
+    for leg in sorted(legs, key=lambda x: x[1]):
 
         unused_legs = copy(flights_db)
         unused_legs.remove(leg)
@@ -139,7 +139,7 @@ def coding_problem_44(arr):
     Note2: [TODO] idea is here, but should avoid using .index(), which is a linear search. Committing as is for now.
     """
     inversions = 0
-    sorted_indexes = [xi[1] for xi in sorted(zip(arr, range(len(arr))), cmp=lambda x, y: cmp(x[0], y[0]))]
+    sorted_indexes = sorted(range(len(arr)), key=lambda x: arr[x])
     for index in range(len(sorted_indexes)):
 
         destination = sorted_indexes.index(index)

legacy2.7/daily_coding_problem_41_45.py legacy/daily_coding_problem_41_45.py

@@ -31,10 +31,10 @@ def coding_problem_47(prices):
     Here's the inefficient one-liner:
 
     >>> prices = [9, 11, 8, 5, 7, 10]
-    >>> max([max(prices[today + 1:]) - prices[today] for today in xrange(len(prices) - 1)])
+    >>> max([max(prices[today + 1:]) - prices[today] for today in range(len(prices) - 1)])
     5
     """
-    max_future_price, max_profit = None, None
+    max_future_price, max_profit = prices[-1], 0
     for index in range(len(prices) - 1, 0, -1):
         max_future_price = max(max_future_price, prices[index])
         max_profit = max(max_profit, max_future_price - prices[index - 1])
@@ -94,7 +94,7 @@ def coding_problem_49(arr):
         cumulative_sum += val
         cumulative_sums.append(cumulative_sum)
 
-    highest_peak, max_sum = None, 0
+    highest_peak, max_sum = cumulative_sums[-1], 0
     for index in range(len(cumulative_sums) - 1, 0, -1):
         highest_peak = max(highest_peak, cumulative_sums[index])
         max_sum = max(max_sum, highest_peak - cumulative_sums[index - 1])

legacy2.7/daily_coding_problem_46_50.py legacy/daily_coding_problem_46_50.py

@@ -0,0 +1,15 @@
+import importlib
+from pathlib import Path
+from doctest import testmod
+
+
+def run_tests(wild_path='daily_coding_problem_*.py', verbose=False):
+
+    for filename in sorted(Path(__file__).parent.glob(wild_path)):
+        module = importlib.import_module(filename.stem)
+        results = testmod(module, verbose=verbose)
+        print(f'{filename.name}: {"FAIL" if results.failed else "PASS"}')
+
+
+if __name__ == '__main__':
+    run_tests()

legacy/run_tests.py

@@ -9,12 +9,12 @@ Example:
     >>> random.seed(0xBADC0FFE)
 
     >>> def sample_gen_fun(n):
-    ...     for x in xrange(n):
+    ...     for x in range(n):
     ...         yield x
 
     >>> num = 10
     >>> hist = [0] * num
-    >>> for trials in xrange(5000):
+    >>> for trials in range(5000):
     ...     hist[coding_problem_15(sample_gen_fun(num))] += 1
 
     >>> all(abs(float(h) / sum(hist) - 1.0 / len(hist)) < 0.01 for h in hist)

legacy2.7/run_tests.py

@@ -8,12 +8,12 @@ def coding_problem_15(sample_generator):
     >>> random.seed(0xBADC0FFE)
 
     >>> def sample_gen_fun(n):
-    ...     for x in xrange(n):
+    ...     for x in range(n):
     ...         yield x
 
     >>> num = 10
     >>> hist = [0] * num
-    >>> for trials in xrange(5000):
+    >>> for trials in range(5000):
     ...     hist[coding_problem_15(sample_gen_fun(num))] += 1
 
     >>> all(abs(float(h) / sum(hist) - 1.0 / len(hist)) < 0.01 for h in hist)

problems/15/README.md

@@ -11,12 +11,12 @@ def coding_problem_15(sample_generator):
     >>> random.seed(0xBADC0FFE)
 
     >>> def sample_gen_fun(n):
-    ...     for x in xrange(n):
+    ...     for x in range(n):
     ...         yield x
 
     >>> num = 10
     >>> hist = [0] * num
-    >>> for trials in xrange(5000):
+    >>> for trials in range(5000):
     ...     hist[coding_problem_15(sample_gen_fun(num))] += 1
 
     >>> all(abs(float(h) / sum(hist) - 1.0 / len(hist)) < 0.01 for h in hist)

problems/15/problem_15.py

@@ -9,11 +9,11 @@ def coding_problem_23(matrix, start, end):
 
     >>> map = [[False, False, False, False], [True, True, False, True],
     ...        [False, False, False, False], [False, False, False, False]]
-    >>> coding_problem_23(matrix, (3, 0), (0, 0))
+    >>> coding_problem_23(map, (3, 0), (0, 0))
     7
 
     >>> map[1][2] = True  # close off path
-    >>> coding_problem_23(matrix, (3, 0), (0, 0))  # None
+    >>> coding_problem_23(map, (3, 0), (0, 0))  # None
 
     """
     coords = [(index_r, index_c) for index_r, row in enumerate(matrix)

problems/15/solution_15.py

@@ -19,7 +19,7 @@ def coding_problem_39(cells):
 
     >>> gol = coding_problem_39(((0, 1), (1, 2), (2, 0), (2, 1), (2, 2)))
     >>> for _ in range(5):
-    ...     print gol
+    ...     print(gol)
     ...     gol.simulate()
     ..*
     *.*

problems/23/solution_23.py

@@ -11,10 +11,10 @@ def coding_problem_47(prices):
     Here's the inefficient one-liner:
 
     >>> prices = [9, 11, 8, 5, 7, 10]
-    >>> max([max(prices[today + 1:]) - prices[today] for today in xrange(len(prices) - 1)])
+    >>> max([max(prices[today + 1:]) - prices[today] for today in range(len(prices) - 1)])
     5
     """
-    max_future_price, max_profit = None, None
+    max_future_price, max_profit = prices[-1], 0
     for index in range(len(prices) - 1, 0, -1):
         max_future_price = max(max_future_price, prices[index])
         max_profit = max(max_profit, max_future_price - prices[index - 1])

problems/39/solution_39.py

@@ -16,7 +16,7 @@ def coding_problem_49(arr):
         cumulative_sum += val
         cumulative_sums.append(cumulative_sum)
 
-    highest_peak, max_sum = None, 0
+    highest_peak, max_sum = cumulative_sums[-1], 0
     for index in range(len(cumulative_sums) - 1, 0, -1):
         highest_peak = max(highest_peak, cumulative_sums[index])
         max_sum = max(max_sum, highest_peak - cumulative_sums[index - 1])

problems/47/solution_47.py

@@ -0,0 +1,16 @@
+import importlib
+from pathlib import Path
+from doctest import testmod
+
+
+def run_tests(wild_path='**/solution_*.py', verbose=False):
+
+    for filename in sorted(Path(__file__).parent.glob(wild_path)):
+        module_name = '.'.join((filename.parent.name, filename.stem))
+        module = importlib.import_module(module_name)
+        results = testmod(module, verbose=verbose)
+        print(f'{filename.name}: {"FAIL" if results.failed else "PASS"}')
+
+
+if __name__ == '__main__':
+    run_tests()