FIRE - ALICE D

lib/max_subarray.rb

@@ -1,8 +1,14 @@
 
-# Time Complexity: ?
-# Space Complexity: ?
+# Time Complexity: O(n)
+# Space Complexity: O(n)
 def max_sub_array(nums)
-    return 0 if nums == nil
-
-    raise NotImplementedError, "Method not implemented yet!"
+    array_of_max_sum_ending_in_i = []
+    array_of_max_sum_ending_in_i[0] = nums[0]
+
+    i = 1
+    while i < nums.length do
+        array_of_max_sum_ending_in_i[i] = [array_of_max_sum_ending_in_i[i - 1] + nums[i], nums[i]].max
+        i += 1
+    end
+    return array_of_max_sum_ending_in_i.max
 end

lib/newman_conway.rb

@@ -1,7 +1,20 @@
 
 
-# Time complexity: ?
-# Space Complexity: ?
+# Time complexity: O(n)
+# Space Complexity: O(n)
 def newman_conway(num)
-  raise NotImplementedError, "newman_conway isn't implemented"
+  pairs = {1=>1, 2=>1}
+  return "1" if num == 1
+  raise ArgumentError if num < 1
+
+  values = "1 1"
+  i = 3
+
+  until i > num
+    pairs[i] = pairs[pairs[i - 1]] + pairs[i - pairs[i - 1]]
+    values += " " + pairs[i].to_s
+    i += 1
+  end
+
+  return values
 end

test/max_sub_array_test.rb

@@ -1,6 +1,6 @@
 require_relative "test_helper"
 
-xdescribe "max subarray" do
+describe "max subarray" do
   it "will work for [-2,1,-3,4,-1,2,1,-5,4]" do
     # Arrange
     input = [-2,1,-3,4,-1,2,1,-5,4]