From 2992f6da829861b77e84039473adc70f86263389 Mon Sep 17 00:00:00 2001
From: amyaim <amyaim99@gmail.com>
Date: Mon, 27 Nov 2017 11:26:28 -0500
Subject: [PATCH] still working

---
 src/main/java/io/zipcoder/Problem2.java     | 28 +++++++++++++++++++
 src/test/java/io/zipcoder/Problem2Test.java | 30 +++++++++++++++++++++
 2 files changed, 58 insertions(+)

diff --git a/src/main/java/io/zipcoder/Problem2.java b/src/main/java/io/zipcoder/Problem2.java
index e0af6a0..64477c6 100644
--- a/src/main/java/io/zipcoder/Problem2.java
+++ b/src/main/java/io/zipcoder/Problem2.java
@@ -1,4 +1,32 @@
 package io.zipcoder;
 
+import java.util.ArrayList;
+
 public class Problem2 {
+
+    //Given that n = 150 your output should be “0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144”
+
+    public  ArrayList<Integer> createAnArrayOfNumber(int n){
+
+        ArrayList<Integer> input = new ArrayList<Integer>();
+
+        for(int i =0; i < n+1; i++){
+            input.add(i);
+        }
+    return  input;
+
+    }
+
+    public ArrayList<Integer> returnSumOfTwoPreceedingNumbersInList(int n){
+        ArrayList<Integer> sumOfTwoNumbers= new ArrayList<Integer>();
+        ArrayList<Integer> input = createAnArrayOfNumber(n);
+
+        for (int i=2; i<input.size(); i++ ) {
+
+            sumOfTwoNumbers.add(createAnArrayOfNumber(n).get(i - 1) + createAnArrayOfNumber(n).get(i - 2));
+        }
+        return sumOfTwoNumbers;
+
+    }
+
 }
diff --git a/src/test/java/io/zipcoder/Problem2Test.java b/src/test/java/io/zipcoder/Problem2Test.java
index fa9ffa5..5ad1a49 100644
--- a/src/test/java/io/zipcoder/Problem2Test.java
+++ b/src/test/java/io/zipcoder/Problem2Test.java
@@ -1,4 +1,34 @@
 package io.zipcoder;
 
+import org.junit.Assert;
+import org.junit.Test;
+
+import java.util.ArrayList;
+
 public class Problem2Test {
+    Problem2 problem2 = new Problem2();
+
+    @Test
+
+    public void createAnArrayOfNumberTest(){
+
+        problem2.createAnArrayOfNumber(10);
+
+        int expected = 11;
+        int actual =  problem2.createAnArrayOfNumber(10).size();
+
+        Assert.assertEquals(expected, actual);
+    }
+    @Test
+    //Given that n = 150 your output should be “0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144”
+
+    public void sumOfTwoProceedingNumberTest(){
+        ArrayList<Integer> sum =problem2.returnSumOfTwoPreceedingNumbersInList(150);
+
+
+        int expected = 3;
+        int actual =  sum.get(1);
+
+        Assert.assertEquals(expected, actual);
+    }
 }