Algorithms-Python

lib/max_subarray.py

@@ -7,6 +7,16 @@ def max_sub_array(nums):
     """
     if nums == None:
         return 0
-    if len(nums) == 0:
+    elif len(nums) == 0:
         return 0
-    pass
+
+    all_maxes = nums[0]
+    max_current_sub = nums[0]
+
+    for i in range(1, len(nums)):
+        max_current_sub = max(max_current_sub + nums[i], nums[i])
+        all_maxes = max(all_maxes, max_current_sub)
+
+    return max_current_sub
+
+

lib/newman_conway.py

@@ -7,4 +7,16 @@ def newman_conway(num):
         Time Complexity: ?
         Space Complexity: ?
     """
-    pass
+    if num < 1:
+        raise ValueError("Must be a positive number")
+    if num == 1:
+        return "1"
+
+    current_list = [0, 1, 1]
+
+    count = 3
+    while count <= num:
+        current_list.append(current_list[current_list[count - 1]] + current_list[count - current_list[count - 1]])
+        count += 1
+
+    return [str(item) for item in current_list]