Ruby & Python Implementation of Day 13 problem (#139)

* Add @aaditkamat as a contributor

* Add Ruby code for Day 1: FizzBuzz problem

* Add Ruby code for Day 2: String reverse problem

* Update README.md for Day 2

* Modify Ruby code and README

* Add condition for nil and wrong type edge cases

* Add a seperate Ruby source code file for palindrome

* Modify code for reverse.rb

* Add seperate palindrome and reverse code sections in README

* Update gitignore

* Refactor palindrome.rb and rename heading in README

* Add solution for Day 3: Hamming Problem

* Add condition for strings of unequal lengths

* Update README

* Change project name and owner in.all-contributorsrc

* Remove merge conflict lines

* Add @shivank86 as a contributor

* Add C++ files for different patterns

* Add author and date comments at the top of C++ files

* Update README.md

* Add solution for Day 6 Problem in Python

* Update README

* Refactor code files

* Modify string representation of output in python files

* Add Ruby solutions for Day 6 problem

* Update README for Ruby code

* Add first version of solutions for Day 7 problem in C++, Java & Ruby

* Modify solutions

* Update Day 7 README

* Remove merge conflicts from CONTRIBUTORS.md

* Add back removed lines in CONTRIBUTORS.md

* Add code sections contributed by @imkaka to day 6 README

* Update README.md

* Add C++ solution

* Add Day 8 solution in C++

* Add Day 8 solution in Java

* Add Day 8 solution in Ruby

* Add Day 8 solution in Python

* Add credits at the top of the code

* Update README

* Update C++ implementation

* Update Python implementation

* Add solution for Day 10: String Permutation Problem in Python

Signed-off-by: Aadit Rahul Kamat <aadit.k12@gmail.com>

* Update Day 10 README

Signed-off-by: Aadit Rahul Kamat <aadit.k12@gmail.com>

* Change heading in README and remove empty directory in day 9

Signed-off-by: Aadit Rahul Kamat <aadit.k12@gmail.com>

* Update README.md

* Add Ruby solutions for Day 13

* Update README

* Add credits to the code

* Add Python solution for Day 13

* Update Day 13 README

* Update fibonacci.py

* Modify Fibonacci python code section in day 13 README

Author: Aadit Kamat

day13/Python/factorial_aadit.py

@@ -0,0 +1,29 @@
+"""
+@author: aaditkamat
+@date: 07/01/2019
+"""
+
+def factorial_recursive(num, result):
+  if num < 0:
+    return "Factorial of #{num} is undefined"
+  if num == 0:
+    return result
+  return factorial_recursive(num - 1, result * num)
+
+def factorial_iterative(num):
+  if num < 0:
+    return "Factorial of #{num} is undefined"
+  result = 1
+  i = 1
+  while i <= num:
+    result *= i
+    i += 1
+  return result
+
+def main():
+  print("Enter an integer: ")
+  num = int(input())
+  print(f'Factorial of {num} is: {factorial_recursive(num, 1)}')
+  print(f'Factorial of {num} is: {factorial_iterative(num)}')
+
+main()

day13/Python/fibonacci.py

@@ -1,31 +1,75 @@
 """
-  @author : vishalshirke7
-  @date : 07/01/2019
+@author: aaditkamat
+@date: 07/01/2019
 """
 
+def fibonacci_recursive_value(num, array, ctr):
+  if num < 1:
+    return f'Incorrect num #{num} for fibonacci sequence'
+  if num == 1 or num == 2:
+    array[num - 1] = 1
+    return array[num - 1]
+  if array[num - 2] != 0 and array[num - 1] != 0:
+    return array[num - 2] + array[num - 3]
+  elif array[num - 2] != 0:
+    array[num - 3] = fibonacci_recursive_value(num - 2, array, ctr + 1)
+  elif array[num - 3] != 0:
+    array[num - 2] = fibonacci_recursive_value(num - 1, array, ctr + 1)
+  else:
+    array[num - 2] = fibonacci_recursive_value(num - 1, array, ctr + 1)
+    array[num - 3] = fibonacci_recursive_value(num - 2, array, ctr + 1)
+  return array[num - 2] + array[num - 3]
 
-# Fibonacci Series using Dynamic Programming
-def fibonacci(n):
-    if n <= 1:
-        return n
+def fibonacci_recursive_sequence(num, arr):
+  if num < 1:
+    return fibonacci_recursive_value(num, arr, 0)
+  start = 1
+  string = 'The sequence is: '
+  while start <= num:
+    if start < num:
+      string += f'{fibonacci_recursive_value(start, arr[:], 0)}, '
     else:
-        if fib_series[n - 1] == 0:
-            fib_series[n - 1] = fibonacci(n - 1)
+      string += f'{fibonacci_recursive_value(start, arr[:], 0)}'
+    start += 1
+  print(string)
 
-        if fib_series[n - 2] == 0:
-            fib_series[n - 2] = fibonacci(n - 2)
-
-        fib_series[n] = fib_series[n - 2] + fib_series[n - 1]
-    return fib_series[n]
+def fibonacci_iterative_sequence(num):
+  if num < 1:
+    return f'Incorrect num {num} for fibonacci sequence'
+  start = 1
+  string = 'The sequence is: '
+  while start <= num:
+    if start < num:
+      string += f'{fibonacci_iterative_value(start)}, '
+    else:
+      string += f'{fibonacci_iterative_value(start)}'
+    start += 1
+  print(string)
 
+def fibonacci_iterative_value(num):
+  if num < 1:
+    return "Incorrect num #{num} for fibonacci sequence"
+  if num == 1 or num == 2:
+    return 1
+  first = 1
+  second = 1
+  ctr = 2
+  while ctr < num:
+    first += second
+    ctr += 1
+    if ctr == num:
+      return first
+    second += first
+    ctr += 1
+  return second
 
-n = int(input())
-fib_series = [0, 1]
-while len(fib_series) < n + 1:
-    fib_series.append(0)
-print(fibonacci(n))
-if n == 0:
-    print(0)
-else:
-    print(", ".join(map(str, fib_series)))
+def main():
+  print("Enter an integer: ")
+  num = int(input())
+  a = [0] * num
+  print(f'The number at position {num} of fibonacci sequence: {fibonacci_recursive_value(num, a, 0)}')
+  fibonacci_recursive_sequence(num, a)
+  print(f'The number at position {num} of fibonacci sequence: {fibonacci_iterative_value(num)}')
+  fibonacci_iterative_sequence(num)
 
+main()

day13/Python/fibonacci_aadit.py

@@ -0,0 +1,75 @@
+"""
+@author: aaditkamat
+@date: 07/01/2019
+"""
+
+def fibonacci_recursive_value(num, array, ctr):
+  if num < 1:
+    return f'Incorrect num #{num} for fibonacci sequence'
+  if num == 1 or num == 2:
+    array[num - 1] = 1
+    return array[num - 1]
+  if array[num - 2] != 0 and array[num - 1] != 0:
+    return array[num - 2] + array[num - 3]
+  elif array[num - 2] != 0:
+    array[num - 3] = fibonacci_recursive_value(num - 2, array, ctr + 1)
+  elif array[num - 3] != 0:
+    array[num - 2] = fibonacci_recursive_value(num - 1, array, ctr + 1)
+  else:
+    array[num - 2] = fibonacci_recursive_value(num - 1, array, ctr + 1)
+    array[num - 3] = fibonacci_recursive_value(num - 2, array, ctr + 1)
+  return array[num - 2] + array[num - 3]
+
+def fibonacci_recursive_sequence(num, arr):
+  if num < 1:
+    return fibonacci_recursive_value(num, arr, 0)
+  start = 1
+  string = 'The sequence is: '
+  while start <= num:
+    if start < num:
+      string += f'{fibonacci_recursive_value(start, arr[:], 0)}, '
+    else:
+      string += f'{fibonacci_recursive_value(start, arr[:], 0)}'
+    start += 1
+  print(string)
+
+def fibonacci_iterative_sequence(num):
+  if num < 1:
+    return f'Incorrect num {num} for fibonacci sequence'
+  start = 1
+  string = 'The sequence is: '
+  while start <= num:
+    if start < num:
+      string += f'{fibonacci_iterative_value(start)}, '
+    else:
+      string += f'{fibonacci_iterative_value(start)}'
+    start += 1
+  print(string)
+
+def fibonacci_iterative_value(num):
+  if num < 1:
+    return "Incorrect num #{num} for fibonacci sequence"
+  if num == 1 or num == 2:
+    return 1
+  first = 1
+  second = 1
+  ctr = 2
+  while ctr < num:
+    first += second
+    ctr += 1
+    if ctr == num:
+      return first
+    second += first
+    ctr += 1
+  return second
+
+def main():
+  print("Enter an integer: ")
+  num = int(input())
+  a = [0] * num
+  print(f'The number at position {num} of fibonacci sequence: {fibonacci_recursive_value(num, a, 0)}')
+  fibonacci_recursive_sequence(num, a)
+  print(f'The number at position {num} of fibonacci sequence: {fibonacci_iterative_value(num)}')
+  fibonacci_iterative_sequence(num)
+
+main()