Fire-Kalki-Dynamic-Programming

lib/max_subarray.rb

@@ -1,8 +1,16 @@
 
-# Time Complexity: ?
-# Space Complexity: ?
+# Time Complexity: O(n)
+# Space Complexity: O(1)
 def max_sub_array(nums)
     return 0 if nums == nil
-
-    raise NotImplementedError, "Method not implemented yet!"
+
+    # raise NotImplementedError, "Method not implemented yet!"
+    largest_sum = nums[0]
+    current = 0
+
+    nums.each do |n|
+        largest_sum = [n, largest_sum + n].max
+        current = [current, largest_sum].max
+    end 
+    return largest_sum
 end

lib/newman_conway.rb

@@ -1,7 +1,19 @@
 
 
-# Time complexity: ?
-# Space Complexity: ?
+# Time complexity: O(n)
+# Space Complexity: O(n)
 def newman_conway(num)
-  raise NotImplementedError, "newman_conway isn't implemented"
+  # raise NotImplementedError, "newman_conway isn't implemented"
+  raise ArgumentError.new if num < 1
+
+  return '1' if num == 1 
+  return '1 1' if num == 2
+  result = [0,1,1]
+
+  for n in (3..num) do 
+    answer = result[result[n - 1]] + result[n - result[n - 1]]
+    result.push(answer)
+  end 
+
+  return result[1,result.length - 1].join(' ')
 end