branches - C. Gutierrez

README.md

@@ -66,3 +66,4 @@ You can use your superdigit solution in the solution for refined_superdigit.  Ca
 ## Problem Source
 
 - [HackerRank Super Digit](https://www.hackerrank.com/challenges/super-digit/problem)
+

lib/fibonacci.rb

@@ -1,8 +1,53 @@
 # Improved Fibonacci
 
-# Time Complexity - ?
-# Space Complexity - ?  (should be O(n))
+# Time Complexity - O(n)
+# Space Complexity - O(n)  (should be O(n))
 # Hint, you may want a recursive helper method
-def fibonacci(n)
-
+
+def fibonacci(target, ultimate = 1, pentultimate = 0, n = 2)
+  if target < 0
+    raise ArgumentError
+  elsif target == 0
+    return 0
+  elsif target == 1
+    return 1
+  end
+
+  if n == target
+    current = pentultimate + ultimate
+    return current
+  else
+    n += 1
+    holder = pentultimate + ultimate
+    pentultimate = ultimate
+    ultimate = holder
+    return fibonacci(target, ultimate = ultimate, pentultimate = pentultimate, n = n)
+  end
 end
+
+# # # # brute force
+# def fibonacci(target)
+#   if target < 0
+#     raise ArgumentError
+#   elsif target == 0
+#     return 0
+#   elsif target == 1
+#     return 1
+#   end
+
+#   ultimate = 1
+#   pentultimate = 0
+#   current = 1
+#   n = 2
+
+#   until n == target
+#     pentultimate = ultimate
+
+#     ultimate = current
+#     current = pentultimate + ultimate
+#     n += 1
+#   end
+
+#   return current
+
+# end

lib/super_digit.rb

@@ -1,15 +1,36 @@
 # Superdigit
 
-# Time Complexity - ?
-# Space Complexity - ?
-def super_digit(n)
-
+# Time Complexity - O(n)
+# Space Complexity - O(log n)
+
+def super_digit(input)
+  # # # # brute recursion
+  if input < 10
+    return input
+  elsif input >= 10
+    sum = 0
+    i = 0
+    limit = input.to_s.length
+    dig_input = input.to_s
+    until i == limit
+      sum += dig_input[i].to_i
+      i += 1
+    end
+    return super_digit(sum)
+  end
 end
-
 
-# Time Complexity - ?
-# Space Complexity - ?
-def refined_super_digit(n, k)
-
+# Time Complexity - O(n)
+# Space Complexity - O(m log n)
+
+# This method uses the super_digit method as a helper as I'm too lazy to write it again. 
+def refined_super_digit(number, repeater)
+  assembled_number = ""
+  dig_number = number.to_s
+  repeater.times do 
+    assembled_number = assembled_number + dig_number
+  end
+  return super_digit(super_digit(number) * repeater)
 end
-
+
+

test/fibonacci_test.rb

@@ -3,54 +3,54 @@
 describe "Fibonacci" do
   it "will raise an error for n < 0" do
     expect {
-        # Act
-        fibonacci(-1)
-        # Assert
-    }.must_raise ArgumentError
-  end
-
-  it "will return 0 for fib(0)" do
-    # Act
-    answer = fibonacci(0)
-
-    # Assert
-    expect(answer).must_equal 0
-  end
-
-  it "will return 1 for fib(1)" do
     # Act
-    answer = fibonacci(1)
-
+    fibonacci(-1)
     # Assert
-    expect(answer).must_equal 1
-  end
-
-  it "will return 1 for fib(2)" do
-    # Act
-    answer = fibonacci(2)
-
-    # Assert
-    expect(answer).must_equal 1
-  end 
-  it "will return 3 for fib(4)" do
-    # Act
-    answer = fibonacci(4)
+  }.must_raise ArgumentError
+end
 
-    # Assert
-    expect(answer).must_equal 3
-  end
-  it "will return 5 for fib(5)" do
-    # Act
-    answer = fibonacci(4)
+it "will return 0 for fib(0)" do
+  # Act
+  answer = fibonacci(0)
+
+  # Assert
+  expect(answer).must_equal 0
+end
 
-    # Assert
-    expect(answer).must_equal 3
-  end
-  it "will return 55 for fib(10)" do
-    # Act
-    answer = fibonacci(10)
+it "will return 1 for fib(1)" do
+  # Act
+  answer = fibonacci(1)
+
+  # Assert
+  expect(answer).must_equal 1
+end
 
-    # Assert
-    expect(answer).must_equal 55
-  end
+it "will return 1 for fib(2)" do
+  # Act
+  answer = fibonacci(2)
+
+  # Assert
+  expect(answer).must_equal 1
+end 
+it "will return 3 for fib(4)" do
+  # Act
+  answer = fibonacci(4)
+
+  # Assert
+  expect(answer).must_equal 3
+end
+it "will return 5 for fib(5)" do
+  # Act
+  answer = fibonacci(4)
+
+  # Assert
+  expect(answer).must_equal 3
+end
+it "will return 55 for fib(10)" do
+  # Act
+  answer = fibonacci(10)
+
+  # Assert
+  expect(answer).must_equal 55
+end
 end

test/super_digit_test.rb

@@ -1,61 +1,61 @@
 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)
-
+    
     # Assert
     expect(answer).must_equal 2
   end
-
+  
   it "will return 5 for super_digit(5)" do
     # Act
     answer = super_digit(5)
-
+    
     # Assert
     expect(answer).must_equal 5
-   end
-
+  end
+  
   it "will return 6 for super_digit(123)" do
     # Act
     answer = super_digit(123)
-
+    
     # Assert
     expect(answer).must_equal 6
   end
-
+  
   it "will return 6 for super_digit(12327)" do
     # Act
     answer = super_digit(12327)
-
+    
     # Assert
     expect(answer).must_equal 6
   end
-
+  
   describe "refined superdigit" do 
     it "will return 1 for n = 1 and k = 1" do
       # Act
       answer = refined_super_digit(1, 1)
-
+      
       # Assert
       expect(answer).must_equal 1      
     end
-
+    
     it "will return 8 for n=9875 and k = 4" do
       # Act
       answer = refined_super_digit(9875, 4)
-
+      
       # Assert
       expect(answer).must_equal 8
     end
-
+    
     it "will return 3 for n=148 and k = 3" do
-        # Act
-        answer = refined_super_digit(148, 3)
-
-        # Assert
-        expect(answer).must_equal 3
+      # Act
+      answer = refined_super_digit(148, 3)
+      
+      # Assert
+      expect(answer).must_equal 3
     end
   end
 end