Linda - first commit

src/main/java/io/zipcoder/Problem2.java

@@ -1,4 +1,38 @@
 package io.zipcoder;
 
+import java.util.ArrayList;
+
 public class Problem2 {
+
+    //convert int array to string
+    public static void main(String[] args) {
+
+        //   System.out.println();
+    }
+
+    public String fibonacciIteration(Int n) {
+
+
+        ArrayList<Integer> finbonacciNumberArray = new ArrayList<Integer>();
+        finbonacciNumberArray.add();
+
+        String returnString = addToArray(finbonacciNumberArray).toString();
+         }
+
+         public ArrayList<Integer> addToArray(ArrayList<Integer> finbonacciNumberArray){
+
+        //method
+
+
+
+
+    }
+
+
+
+
+    public String fibonacciRecursion(Int n) {
+
+    }
 }
+

src/test/java/io/zipcoder/Problem2Test.java

@@ -1,4 +1,37 @@
 package io.zipcoder;
 
+import org.junit.Assert;
+import org.junit.Before;
+import org.junit.Test;
+
 public class Problem2Test {
+
+    private Problem2 problem;
+
+    @Before
+    public void setUp(){
+        problem = new Problem2();
+    }
+
+    @Test
+    public void fibonacciIterationTest() {
+        String expected = "0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144";
+        String actual = problem.fibonacciIteration(150);
+        Assert.assertEquals(expected, actual);
+    }
+
+    @Test
+    public void fibonacciRecursionTest(){
+        String expected = "0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144";
+        String actual = problem.fibonacciRecursion(150);
+        Assert.assertEquals(expected, actual);
+    }
+
+    @Test
+    public void fibonacciInputZeroTest(){
+        String expected = "0";
+        String actual = problem.fibonacciIteration(0);
+        Assert.assertEquals(expected,actual);
+    }
+
 }