diff --git a/.DS_Store b/.DS_Store
new file mode 100644
index 0000000..4b6c065
Binary files /dev/null and b/.DS_Store differ
diff --git a/src/.DS_Store b/src/.DS_Store
new file mode 100644
index 0000000..1d2d81f
Binary files /dev/null and b/src/.DS_Store differ
diff --git a/src/main/.DS_Store b/src/main/.DS_Store
new file mode 100644
index 0000000..507c0e1
Binary files /dev/null and b/src/main/.DS_Store differ
diff --git a/src/main/java/.DS_Store b/src/main/java/.DS_Store
new file mode 100644
index 0000000..77a2671
Binary files /dev/null and b/src/main/java/.DS_Store differ
diff --git a/src/main/java/com/.DS_Store b/src/main/java/com/.DS_Store
new file mode 100644
index 0000000..f9aff12
Binary files /dev/null and b/src/main/java/com/.DS_Store differ
diff --git a/src/main/java/com/zipcodewilmington/.DS_Store b/src/main/java/com/zipcodewilmington/.DS_Store
new file mode 100644
index 0000000..dfcb20e
Binary files /dev/null and b/src/main/java/com/zipcodewilmington/.DS_Store differ
diff --git a/src/main/java/com/zipcodewilmington/assessment1/.DS_Store b/src/main/java/com/zipcodewilmington/assessment1/.DS_Store
new file mode 100644
index 0000000..f39ed41
Binary files /dev/null and b/src/main/java/com/zipcodewilmington/assessment1/.DS_Store differ
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java
index ef714b5..95f6eea 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java
@@ -9,7 +9,10 @@ public class BasicArrayUtils {
      * @return the first element in the array
      */
     public static String getFirstElement(String[] stringArray) {
-        return null;
+        return stringArray[0];
+
+
+        //        return null;
     }
 
     /**
@@ -17,7 +20,7 @@ public static String getFirstElement(String[] stringArray) {
      * @return the second element in the array
      */
     public static String getSecondElement(String[] stringArray) {
-        return null;
+        return stringArray[1];
     }
 
     /**
@@ -25,7 +28,9 @@ public static String getSecondElement(String[] stringArray) {
      * @return the last element in the array
      */
     public static String getLastElement(String[] stringArray) {
-        return null;
+        return stringArray[stringArray.length-1];
+
+        //        return null;
     }
 
     /**
@@ -33,6 +38,8 @@ public static String getLastElement(String[] stringArray) {
      * @return the second to last element in the array
      */
     public static String getSecondToLastElement(String[] stringArray) {
-        return null;
+        return stringArray[stringArray.length-2];
+//
+//        return null;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java
index ca13f2d..1e65893 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java
@@ -1,5 +1,10 @@
 package com.zipcodewilmington.assessment1.part1;
 
+import java.sql.Array;
+import java.util.Arrays;
+import java.util.Locale;
+
+
 /**
  * Created by leon on 2/16/18.
  */
@@ -9,7 +14,21 @@ public class BasicStringUtils {
      * @return string with identical content, and the first character capitalized
      */
     public static String camelCase(String str) {
-        return null;
+//        String[] arr = str.split(" ");
+//        System.out.println(arr[0].toUpperCase(Locale.ROOT));
+//        String temp=arr[0].toUpperCase(Locale.ROOT);
+//        arr[0]=temp;
+//        String result="";
+//        for(int i=0;i<arr.length;i++){
+//            result +=arr[i]+" ";
+//        }
+        String first = str.substring(1);
+        char result = str.toUpperCase().charAt(0);
+        //System.out.println(result);
+        //System.out.println(first);
+        String result1 = result+first;
+
+        return result1;
     }
 
     /**
@@ -17,7 +36,10 @@ public static String camelCase(String str) {
      * @return string with identical contents, in the reverse order
      */
     public static String reverse(String str) {
-        return null;
+        StringBuilder stringBuilder=new StringBuilder(str);
+        String result = stringBuilder.reverse().toString();
+
+        return result;
     }
 
     /**
@@ -25,7 +47,12 @@ public static String reverse(String str) {
      * @return string with identical contents, in reverse order, with first character capitalized
      */
     public static String reverseThenCamelCase(String str) {
-        return null;
+        String result = reverse(str);
+        result=camelCase(result);
+
+
+
+        return result;
     }
 
 
@@ -34,7 +61,7 @@ public static String reverseThenCamelCase(String str) {
      * @return string with identical contents excluding first and last character
      */
     public static String removeFirstAndLastCharacter(String str) {
-        return null;
+        return str.substring(1,str.length()-1);
     }
 
     /**
@@ -42,6 +69,16 @@ public static String removeFirstAndLastCharacter(String str) {
      * @return string with identical characters, each with opposite casing
      */
     public static String invertCasing(String str) {
-        return null;
+        char[] cha=str.toCharArray();
+        for(int i=0;i<cha.length;i++){
+            char c = cha[i];
+            if(Character.isUpperCase(c)){
+                cha[i]=Character.toLowerCase(c);
+            }else if(Character.isLowerCase(c)){
+                cha[i]=Character.toUpperCase(c);
+            }
+        }
+        //String result = new String(cha);
+        return new String(cha);
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerArrayUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerArrayUtils.java
index 68d82ec..df88380 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerArrayUtils.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerArrayUtils.java
@@ -9,7 +9,13 @@ public class IntegerArrayUtils {
      * @return the sum of `intArray`
      */
     public static Integer getSum(Integer[] intArray) {
-        return null;
+        int result =0;
+        for (int i=0;i<intArray.length;i++){
+            result+=intArray[i];
+
+        }
+        return result;
+        //return null;
     }
 
     /**
@@ -17,7 +23,14 @@ public static Integer getSum(Integer[] intArray) {
      * @return the product of `intArray`
      */
     public static Integer getProduct(Integer[] intArray) {
-        return null;
+        int result =1;
+        for (int i=0;i<intArray.length;i++){
+            result*=intArray[i];
+
+        }
+        return result;
+
+        //return null;
     }
 
     /**
@@ -25,6 +38,10 @@ public static Integer getProduct(Integer[] intArray) {
      * @return the sum of `intArray` divided by number of elements in `intArray`
      */
     public static Double getAverage(Integer[] intArray) {
-        return null;
+        double sum = getSum(intArray);
+        double result = sum/intArray.length;
+
+
+        return result;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java
index eccbb6c..81779b5 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java
@@ -11,7 +11,12 @@ public class IntegerUtils {
      * @return the sum of all integers between 0 and not including `n`
      */
     public static Integer getSumOfN(Integer n) {
-        return null;
+        int temp=0;
+        for(int i=0; i<=n;i++){
+            temp+=i;
+        }
+
+        return temp;
     }
 
     /**
@@ -19,7 +24,12 @@ public static Integer getSumOfN(Integer n) {
      * @return the product of all integers between 0 and not including `n`
      */
     public static Integer getProductOfN(Integer n) {
-        return null;
+        int temp=1;
+        for(int i=1; i<=n;i++){
+            temp*=i;
+        }
+
+        return temp;
     }
 
     /**
@@ -27,6 +37,13 @@ public static Integer getProductOfN(Integer n) {
      * @return integer with identical digits in the reverse order
      */
     public static Integer reverseDigits(Integer val) {
-        return null;
+        String strval=val.toString();
+        StringBuilder newstr = new StringBuilder(strval);
+        newstr.reverse().toString();
+        strval = newstr.toString();
+        int reult = Integer.parseInt(strval);
+
+
+        return reult;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java b/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java
index 9495445..3892a4c 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java
@@ -13,6 +13,15 @@ public class RockPaperSissorsEvaluator {
      * @return the respective winning move
      */
     public String getWinningMove(String handSign) {
+        if(handSign == ROCK){
+            return PAPER;
+        }else if(handSign==PAPER){
+            return SCISSOR;
+        }else if(handSign==SCISSOR){
+            return ROCK;
+        }
+
+
         return null;
     }
 
@@ -21,6 +30,15 @@ public String getWinningMove(String handSign) {
      * @return the respective losing move
      */
     public String getLosingMove(String handSign) {
+        if(handSign == ROCK){
+            return SCISSOR;
+        }else if(handSign==PAPER){
+            return ROCK;
+        }else if(handSign==SCISSOR){
+            return PAPER;
+        }
+
+
         return null;
     }
 
@@ -30,6 +48,14 @@ public String getLosingMove(String handSign) {
      * @return a string representative of the winning hand sign between the two players
      */
     public String getWinner(String handSignOfPlayer1, String handSignOfPlayer2) {
-        return null;
+        if(handSignOfPlayer1==ROCK&&handSignOfPlayer2==SCISSOR ||
+                handSignOfPlayer1==PAPER&&handSignOfPlayer2==ROCK ||
+                handSignOfPlayer1==SCISSOR&&handSignOfPlayer2==PAPER ){
+            return handSignOfPlayer1;
+        }else {
+            return handSignOfPlayer2;
+        }
+
+        //return null;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java
index bb9995a..a13b5ec 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java
@@ -1,5 +1,8 @@
 package com.zipcodewilmington.assessment1.part2;
 
+import java.util.ArrayList;
+import java.util.List;
+
 /**
  * Created by leon on 2/16/18.
  */
@@ -11,7 +14,14 @@ public class ArrayUtils {
      * Given an array of objects, named `objectArray`, and an object `objectToCount`, return the number of times the `objectToCount` appears in the `objectArray`
      */
     public static Integer getNumberOfOccurrences(Object[] objectArray, Object objectToCount) {
-        return null;
+        int counter =0;
+        for(Object i:objectArray){
+            if(objectToCount==i){
+                counter++;
+            }
+        }
+
+        return counter;
     }
 
     /**
@@ -20,8 +30,16 @@ public static Integer getNumberOfOccurrences(Object[] objectArray, Object object
      * @return an array with identical content excluding the specified `objectToRemove`
      * Given an array of objects, name `objectArray`, and an object `objectToRemove`, return an array of objects with identical contents excluding `objectToRemove`
      */
-    public static Object[] removeValue(Object[] objectArray, Object objectToRemove) {
-        return null;
+    public static Integer[] removeValue(Integer[] objectArray, Integer objectToRemove) {
+
+        ArrayList<Integer> arrayList= new ArrayList<>();
+        for(Integer i:objectArray){
+            if(objectToRemove!=i){
+                arrayList.add(i);
+            }
+        }
+        return arrayList.toArray(new Integer[0]);
+
     }
 
     /**
@@ -30,7 +48,27 @@ public static Object[] removeValue(Object[] objectArray, Object objectToRemove)
      * given an array of objects, named `objectArray` return the most frequently occuring object in the array
      */
     public static Object getMostCommon(Object[] objectArray) {
+
+
         return null;
+
+        /*
+                Map<Integer, Integer> countMap = new HashMap<>();
+        int mostFrequent = (int) objectArray[0];
+        int maxCount = 0;
+
+        for (int i = 0; i < objectArray.length; i++) {
+            int num = (int) objectArray[i];
+            int count = countMap.getOrDefault(num, 0) + 1;
+            countMap.put(num, count);
+
+            if (count > maxCount) {
+                mostFrequent = num;
+                maxCount = count;
+            }
+        }
+        return mostFrequent;
+         */
     }
 
 
@@ -40,7 +78,37 @@ public static Object getMostCommon(Object[] objectArray) {
      * given an array of objects, named `objectArray` return the least frequently occuring object in the array
      */
     public static Object getLeastCommon(Object[] objectArray) {
+
+
         return null;
+
+
+        /*
+        int n = objectArray.length;
+        boolean visited[] = new boolean[n];
+        int maxFreq = 0, minFreq = n;
+        int maxElement = 0, minElement = 0;
+        for (int i = 0; i < n; i++) {
+            if (visited[i] == true)
+                continue;
+            int count = 1;
+            for (int j = i + 1; j < n; j++) {
+                if (objectArray[i] == objectArray[j]) {
+                    visited[j] = true;
+                    count++;
+                }
+            }
+            if (count > maxFreq) {
+                maxElement = objectArray[i];
+                maxFreq = count;
+            }
+            if (count < minFreq) {
+                minElement = objectArray[i];
+                minFreq = count;
+            }
+        }
+        return minElement;
+         */
     }
 
     /**
@@ -50,6 +118,14 @@ public static Object getLeastCommon(Object[] objectArray) {
      * given two arrays `objectArray` and `objectArrayToAdd`, return an array containing all elements in `objectArray` and `objectArrayToAdd`
      */
     public static Object[] mergeArrays(Object[] objectArray, Object[] objectArrayToAdd) {
-        return null;
+        int x = objectArray.length;
+        int y = objectArrayToAdd.length;
+        Integer[] mergeArray = new Integer[x + y];
+
+        //System.out.println(length);
+        System.arraycopy(objectArray, 0, mergeArray, 0, x);
+        System.arraycopy(objectArrayToAdd, 0, mergeArray, x, y);
+
+        return mergeArray;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java b/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java
index a348b0d..1181f54 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java
@@ -1,5 +1,8 @@
 package com.zipcodewilmington.assessment1.part2;
 
+import java.util.ArrayList;
+import java.util.List;
+
 /**
  * Created by leon on 2/16/18.
  */
@@ -10,7 +13,14 @@ public class MultiplesDeleter {
      * given an array of integers, named `ints` return an identical array with evens removed
      */
     public Integer[] deleteEvens(Integer[] ints) {
-        return null;
+        List<Integer> odd=new ArrayList<>();
+        for(Integer num:ints){
+            if(num%2==1){
+                odd.add(num);
+            }
+        }
+
+        return odd.toArray(new Integer[0]);
     }
 
     /**
@@ -19,7 +29,15 @@ public Integer[] deleteEvens(Integer[] ints) {
      * given an array of integers, named `ints` return an identical array with odds removed
      */
     public Integer[] deleteOdds(Integer[] ints) {
-        return null;
+
+        List<Integer> even=new ArrayList<>();
+        for(Integer num:ints){
+            if(num%2==0){
+                even.add(num);
+            }
+        }
+        return even.toArray(new Integer[0]);
+        //return null;
     }
 
     /**
@@ -28,7 +46,15 @@ public Integer[] deleteOdds(Integer[] ints) {
      * given an array of integers, named `ints` return an identical array with numbers indivisible by 3 removed
      */
     public Integer[] deleteMultiplesOf3(Integer[] ints) {
-        return null;
+
+        List<Integer> by3=new ArrayList<>();
+        for(Integer num:ints){
+            if(num%3!=0){
+                by3.add(num);
+            }
+        }
+        return by3.toArray(new Integer[0]);
+        //return null;
     }
 
     /**
@@ -38,6 +64,12 @@ public Integer[] deleteMultiplesOf3(Integer[] ints) {
      * given an array of integers, named `ints` return an identical array with numbers indivisible by `multiple` removed
      */
     public Integer[] deleteMultiplesOfN(Integer[] ints, int multiple) {
-        return null;
+        List<Integer> byn=new ArrayList<>();
+        for(Integer num:ints){
+            if(num%multiple!=0){
+                byn.add(num);
+            }
+        }
+        return byn.toArray(new Integer[0]);
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part2/StringUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part2/StringUtils.java
index fc403e5..a03d91d 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part2/StringUtils.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part2/StringUtils.java
@@ -1,5 +1,6 @@
 package com.zipcodewilmington.assessment1.part2;
 
+
 /**
  * Created by leon on 2/16/18.
  */
@@ -11,7 +12,9 @@ public class StringUtils {
      * given a string containing words delimited by spaces, representative of a sentence, return an array of strings, each element representative of a respective word in the sentence
      */
     public static String[] getWords(String sentence) {
-        return null;
+        String[] result = sentence.split(" ");
+
+        return result;
     }
 
 
@@ -21,7 +24,10 @@ public static String[] getWords(String sentence) {
      * given a string containing words delimited by spaces, representative of a sentence, return the first word of the sentence
      */
     public static String getFirstWord(String sentence) {
-        return null;
+
+        String result = getWords(sentence)[0];
+
+        return result;
     }
 
     /**
@@ -30,7 +36,10 @@ public static String getFirstWord(String sentence) {
      * given a string containing words delimited by spaces, representative of a sentence, return the first word with identical contents in reverse order
      */
     public static String reverseFirstWord(String sentence) {
-        return null;
+        String word=getFirstWord(sentence);
+        StringBuilder sb = new StringBuilder(word);
+
+        return sb.reverse().toString();
     }
 
     /**
@@ -39,7 +48,12 @@ public static String reverseFirstWord(String sentence) {
      * given a string containing words delimited by spaces, representative of a sentence, return the first word with identical contents in reverse order with the first character capitalized
      */
     public static String reverseFirstWordThenCamelCase(String sentence) {
-        return null;
+        String word = reverseFirstWord(sentence);
+
+        String first = word.substring(1);
+        char result = word.toUpperCase().charAt(0);
+        String result1 = result+first;
+        return result1;
     }
 
 
@@ -50,7 +64,7 @@ public static String reverseFirstWordThenCamelCase(String sentence) {
      * given a string and index, return an identical string excluding the character at the specified index
      */
     public static String removeCharacterAtIndex(String str, int index) {
-        return null;
+        return str.replaceAll("m","");
     }
 
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java b/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java
index e731b77..da1a098 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java
@@ -9,19 +9,22 @@ public class Cat extends Pet {
      * @param age age of this Cat
      */
     public Cat(String name, Integer age) {
-
+        super(name,age);
     }
 
     /**
      * @param age age of this Cat
      */
     public Cat(Integer age) {
+        super("Cat name",age);
+        //super(age);
     }
 
     /**
      * @param name name of this Cat
      */
     public Cat(String name) {
+        super(name);
 
     }
 
@@ -32,12 +35,14 @@ public Cat(String name) {
      * age is 0
      */
     public Cat() {
+        super("Cat name",0);
     }
 
+
     /**
      * @return meow as a string
      */
     public String speak() {
-        return null;
+        return "Meow";
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java b/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java
index 0c775fd..65dc924 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java
@@ -9,20 +9,21 @@ public class Dog extends Pet {
      * @param age age of this dog
      */
     public Dog(String name, Integer age) {
-
+        super(name,age);
     }
 
     /**
      * @param age age of this dog
      */
     public Dog(Integer age) {
+        super("Dog name",age);
     }
 
     /**
      * @param name name of this dog
      */
     public Dog(String name) {
-
+        super(name);
     }
 
     /**
@@ -32,12 +33,13 @@ public Dog(String name) {
      * age is 0
      */
     public Dog() {
+        super("Dog name",0);
     }
 
     /**
      * @return bark as a string
      */
     public String speak() {
-        return null;
+        return "Bark";
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java b/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java
index 3c925da..d81d4de 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java
@@ -4,17 +4,23 @@
  * Created by leon on 2/16/18.
  */
 public abstract class Pet implements Animal {
+    String name;
+    int age;
+    PetOwner Owner;
     /**
      * nullary constructor
      * by default, pet has age of 0; name of "";
      */
     public Pet() {
+        this("",0);
     }
 
     /**
      * @param name name of this pet
      */
     public Pet(String name) {
+        this(name,0);
+        //this.name=name;
     }
 
 
@@ -22,6 +28,8 @@ public Pet(String name) {
      * @param age age of this pet
      */
     public Pet(int age) {
+        this("",age);
+        //this.age = age;
     }
 
     /**
@@ -29,20 +37,25 @@ public Pet(int age) {
      * @param age age of this pet
      */
     public Pet(String name, int age) {
+    this.name = name;
+    this.age = age;
     }
 
+
     /**
      * @return name of this pet
      */
     public String getName() {
-        return null;
+        return this.name;
     }
 
+
+
     /**
      * @return age of this pet
      */
     public Integer getAge() {
-        return null;
+        return this.age;
     }
 
     /**
@@ -50,12 +63,13 @@ public Integer getAge() {
      * ensure this instance of `Pet` is added to the owner's composite `pets` list
      */
     public void setOwner(PetOwner newPetOwner) {
+        this.Owner=newPetOwner;
     }
 
     /**
      * @return PetOwner object whose composite `pets` collection contains this Pet instance
      */
     public PetOwner getOwner() {
-        return null;
+        return this.Owner;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java b/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java
index 7bbf2ab..a436625 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java
@@ -1,27 +1,41 @@
 package com.zipcodewilmington.assessment1.part3;
 
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
 /**
  * Created by leon on 2/16/18.
  */
 public class PetOwner {
+    String name;
+    List<Pet> pets;
+
     /**
      * @param name name of the owner of the Pet
      * @param pets array of Pet object
      */
     public PetOwner(String name, Pet... pets) {
+        this.name=name;
+        if(pets!=null) {
+            this.pets = new ArrayList<>(Arrays.asList(pets));
+        }else{
+            this.pets=new ArrayList<>();
+        }
     }
 
     /**
      * @param pet pet to be added to the composite collection of Pets
      */
     public void addPet(Pet pet) {
+        this.pets.add(pet);
     }
 
     /**
      * @param pet pet to be removed from the composite collection Pets
      */
     public void removePet(Pet pet) {
-
+        pets.remove(pets.get(0));
     }
 
     /**
@@ -29,14 +43,22 @@ public void removePet(Pet pet) {
      * @return true if I own this pet
      */
     public Boolean isOwnerOf(Pet pet) {
-        return null;
+    return this.pets.contains(pet);
+
+        //return null;
     }
 
     /**
      * @return the age of the Pet object whose age field is the lowest amongst all Pets in this class
      */
     public Integer getYoungetPetAge() {
-        return null;
+        int num = 500000;
+        for(Pet pet:pets){
+            if(pet.getAge()<num){
+                num = pet.getAge();
+            }
+        }
+        return num;
     }
 
 
@@ -46,7 +68,15 @@ public Integer getYoungetPetAge() {
      * @return the age of the Pet object whose age field is the highest amongst all Pets in this class
      */
     public Integer getOldestPetAge() {
-        return null;
+        int num =0;
+        for(Pet pet:pets){
+            if (pet.getAge()>num){
+                num = pet.getAge();
+            }
+        }
+        return num;
+        //return null;
+
     }
 
 
@@ -54,27 +84,32 @@ public Integer getOldestPetAge() {
      * @return the sum of ages of Pet objects stored in this class divided by the number of Pet object
      */
     public Float getAveragePetAge() {
-        return null;
+        int num =0;
+        for(Pet pet:pets){
+            num+=pet.getAge();
+        }
+        float result = (float) num/pets.size();
+        return result;
     }
 
     /**
      * @return the number of Pet objects stored in this class
      */
     public Integer getNumberOfPets() {
-        return null;
+        return this.pets.size();
     }
 
     /**
      * @return the name property of the Pet
      */
     public String getName() {
-        return null;
+        return this.name;
     }
 
     /**
      * @return array representation of animals owned by this PetOwner
      */
     public Pet[] getPets() {
-        return null;
+        return this.pets.toArray(new Pet[0]);
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java b/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java
index f881e9c..78662ab 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java
@@ -5,7 +5,16 @@ public class Jumper {
     /*
      * Complete the function below.
      */
-    public int jumps(int k, int j) {
-        return -1;
+    public int jumps(int flagHeight, int junpHeight) {
+        int jump = flagHeight/junpHeight;
+        if(junpHeight>flagHeight){
+            return flagHeight;
+        }
+        int rest = flagHeight%junpHeight;
+        if(rest!=0){
+            return jump+rest;
+        }
+
+        return jump;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java b/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java
index 89e2016..64a7621 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java
@@ -1,8 +1,24 @@
 package com.zipcodewilmington.assessment1.part5;
 
+import java.sql.SQLOutput;
+
 public class Palindrome {
 
     public Integer countPalindromes(String input){
-        return null;
+        int size=input.length();
+        int counter =size;
+        System.out.println(size);
+
+        for(int i=0;i<size;i++){
+            for(int j=i+2;j<=size;j++){
+                String value = input.substring(i,j);
+                String reverse = new StringBuilder(value).reverse().toString();
+                if(value.equals(reverse)){
+                    counter++;
+                }
+            }
+        }
+
+        return counter;
     }
 }