Steph-Branches

lib/fibonacci.rb

@@ -4,5 +4,22 @@
 # Space Complexity - ?  (should be O(n))
 # Hint, you may want a recursive helper method
 def fibonacci(n)
-
+    return fibonacci_helper(n, solution = [0,1], current = 2)
 end
+
+   def fibonacci_helper(n, s, current)
+    if n < 0
+      raise ArgumentError
+    end
+    if n == 0 || n == 1
+      return n
+    end
+    if current == n
+      return s[0] + s[1]
+    end
+    temp = s[1]
+    s[1] = s[0] + s[1]
+    s[0] = temp
+    return fibonacci_helper(n, s, current + 1)
+   end
+

lib/super_digit.rb

@@ -3,13 +3,18 @@
 # Time Complexity - ?
 # Space Complexity - ?
 def super_digit(n)
-
+  if n < 0
+    return argumentError
+  end
+  return n if n.to_s.length == 1
+  return super_digit(n.digits.sum)
 end
 
 
 # Time Complexity - ?
 # Space Complexity - ?
 def refined_super_digit(n, k)
+
 
 end
 

test/fibonacci_test.rb

@@ -1,6 +1,6 @@
 require_relative "test_helper"
 
-describe "Fibonacci" do
+xdescribe "Fibonacci" do
   it "will raise an error for n < 0" do
     expect {
         # Act

test/super_digit_test.rb

@@ -1,6 +1,6 @@
 require_relative "test_helper"
 
-xdescribe "super_digit" do
+describe "super_digit" do
   it "will return 2 for super_digit(9875)" do
     # Act
     answer = super_digit(9875)