diff --git a/lib/max_subarray.py b/lib/max_subarray.py
index 4e892e0..0f0f508 100644
--- a/lib/max_subarray.py
+++ b/lib/max_subarray.py
@@ -1,12 +1,20 @@
-
 def max_sub_array(nums):
     """ Returns the max subarray of the given list of numbers.
         Returns 0 if  nums is None or an empty list.
-        Time Complexity: ?
-        Space Complexity: ?
+        Time Complexity: O(n)
+        Space Complexity: O(1)
     """
     if nums == None:
         return 0
     if len(nums) == 0:
         return 0
-    pass
+    
+    max_sum = 0
+    current_sum = 0
+
+    for num in nums:
+        current_sum = max(0, current_sum + num)
+        max_sum = max(max_sum, current_sum)
+        if max_sum <= 0:
+            return max(nums)
+    return max_sum
diff --git a/lib/newman_conway.py b/lib/newman_conway.py
index 70a3353..b20f7fe 100644
--- a/lib/newman_conway.py
+++ b/lib/newman_conway.py
@@ -1,10 +1,22 @@
-
-
-# Time complexity: ?
-# Space Complexity: ?
 def newman_conway(num):
     """ Returns a list of the Newman Conway numbers for the given value.
-        Time Complexity: ?
-        Space Complexity: ?
+        Time Complexity: O(n)
+        Space Complexity: O(n)
     """
-    pass
+    if num == 0:
+        raise ValueError
+
+    if num == 1:
+        return '1'
+
+    if num == 2:
+        return '1 1'
+
+    sequence = [0, 1, 1]
+    for i in range(3, num + 1):
+        next_num = sequence[sequence[i - 1]] + sequence[i - sequence[i - 1]]
+        sequence.append(next_num)
+    
+    string_sequence = [str(number) for number in sequence[1:]]
+    string_sequence = ' '.join(string_sequence)
+    return  string_sequence