diff --git a/pom.xml b/pom.xml
index b029312..510b582 100644
--- a/pom.xml
+++ b/pom.xml
@@ -14,8 +14,8 @@
                 <artifactId>maven-compiler-plugin</artifactId>
                 <version>3.8.0</version>
                 <configuration>
-                    <source>1.8</source>
-                    <target>1.8</target>
+                    <source>11</source>
+                    <target>11</target>
                 </configuration>
             </plugin>
         </plugins>
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java
index ef714b5..1983beb 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicArrayUtils.java
@@ -9,7 +9,8 @@ public class BasicArrayUtils {
      * @return the first element in the array
      */
     public static String getFirstElement(String[] stringArray) {
-        return null;
+
+        return stringArray[0];
     }
 
     /**
@@ -17,7 +18,8 @@ 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 +27,7 @@ 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];
     }
 
     /**
@@ -33,6 +35,7 @@ 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];
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java
index ca13f2d..aad8e6d 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part1/BasicStringUtils.java
@@ -9,7 +9,8 @@ public class BasicStringUtils {
      * @return string with identical content, and the first character capitalized
      */
     public static String camelCase(String str) {
-        return null;
+
+        return str.substring(0, 1).toUpperCase() + str.substring(1);
     }
 
     /**
@@ -17,7 +18,13 @@ public static String camelCase(String str) {
      * @return string with identical contents, in the reverse order
      */
     public static String reverse(String str) {
-        return null;
+        String reversedStr = "";
+
+        for (int i = 0; i < str.length(); i++) {
+            reversedStr = str.charAt(i) + reversedStr;
+        }
+
+        return reversedStr;
     }
 
     /**
@@ -25,7 +32,9 @@ 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;
+
+
+        return reverse(str).substring(0, 1).toUpperCase() + reverse(str).substring(1);
     }
 
 
@@ -34,7 +43,9 @@ 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 +53,28 @@ public static String removeFirstAndLastCharacter(String str) {
      * @return string with identical characters, each with opposite casing
      */
     public static String invertCasing(String str) {
-        return null;
+
+     char[] characters = str.toCharArray();
+
+     for (int i =0; i < characters.length; i++){
+        char c = characters[i];
+        if(Character.isUpperCase(c)){
+            characters[i] = Character.toLowerCase(c);
+        } else if (Character.isLowerCase(c)) {
+            characters[i] = Character.toUpperCase(c);
+        }
+     }
+//        StringBuilder string = new StringBuilder();
+//
+//        for (char c : str.toCharArray()) {
+//            if (Character.isUpperCase(c))
+//                c = Character.toLowerCase(c);
+//
+//            else c = Character.toUpperCase(c);
+//            string.append(c);
+//        }
+
+
+        return new String(characters);
     }
-}
+}
\ No newline at end of file
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerArrayUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerArrayUtils.java
index 68d82ec..9083f5b 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerArrayUtils.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerArrayUtils.java
@@ -9,7 +9,14 @@ public class IntegerArrayUtils {
      * @return the sum of `intArray`
      */
     public static Integer getSum(Integer[] intArray) {
-        return null;
+        int sum = 0;
+
+        for(int i = 0; i <= intArray.length; i++){
+            sum = sum + i;
+        }
+
+
+        return sum;
     }
 
     /**
@@ -17,7 +24,17 @@ public static Integer getSum(Integer[] intArray) {
      * @return the product of `intArray`
      */
     public static Integer getProduct(Integer[] intArray) {
-        return null;
+
+        int sum = 1;
+
+        for(int i : intArray){
+            sum = sum * i;
+        }
+
+
+        return sum;
+
+
     }
 
     /**
@@ -25,6 +42,14 @@ 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;
+        int sum = 0;
+        double avg = 0;
+        for (int i = 0; i <= intArray.length; i++) {
+            sum = sum + i;
+            avg = sum/intArray.length;
+        }
+
+
+        return  avg;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java
index eccbb6c..d89acd6 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part1/IntegerUtils.java
@@ -11,7 +11,13 @@ public class IntegerUtils {
      * @return the sum of all integers between 0 and not including `n`
      */
     public static Integer getSumOfN(Integer n) {
-        return null;
+        int sum = 0;
+
+
+        for (int i = 0; i <= n; i++) {
+            sum = sum + i;
+        }
+        return sum;
     }
 
     /**
@@ -19,14 +25,32 @@ 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 sum = 1;
+
+    for (int i = 1; i <= n; i++){
+        sum = sum * i;}
+
+
+
+        return sum;
     }
 
     /**
      * @param val integer value input by client
      * @return integer with identical digits in the reverse order
      */
-    public static Integer reverseDigits(Integer val) {
-        return null;
+    public static Integer reverseDigits(Integer val)  {
+    int reverse = val;
+    StringBuilder sb = new StringBuilder();
+    sb.append(reverse);
+    sb = sb.reverse();
+    String string = sb.toString();
+
+    reverse = Integer.parseInt(string);
+
+    return reverse;
+
+
     }
+
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java b/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java
index 9495445..c08f932 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part1/RockPaperSissorsEvaluator.java
@@ -13,7 +13,17 @@ public class RockPaperSissorsEvaluator {
      * @return the respective winning move
      */
     public String getWinningMove(String handSign) {
-        return null;
+        String winningMove = "";
+        if(handSign.equals(ROCK)){
+            return PAPER;
+        } else if (handSign.equals(PAPER)) {
+            return SCISSOR;
+        } else if (handSign.equals(SCISSOR)) {
+            return ROCK;
+
+        }
+
+        return winningMove;
     }
 
     /**
@@ -21,7 +31,18 @@ public String getWinningMove(String handSign) {
      * @return the respective losing move
      */
     public String getLosingMove(String handSign) {
-        return null;
+        String losingMove = "";
+
+        if(handSign.equals(ROCK)){
+            return SCISSOR;
+        } else if (handSign.equals(PAPER)) {
+            return ROCK;
+        } else if (handSign.equals(SCISSOR)) {
+            return PAPER;
+
+        }
+
+        return losingMove;
     }
 
     /**
@@ -30,6 +51,12 @@ 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;
+       String winner = "";
+
+       if(handSignOfPlayer1.equals(ROCK) && handSignOfPlayer2.equals(SCISSOR)){
+           return ROCK;
+       }
+
+        return winner;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java
index bb9995a..3729cdb 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part2/ArrayUtils.java
@@ -1,5 +1,7 @@
 package com.zipcodewilmington.assessment1.part2;
 
+import java.util.*;
+
 /**
  * Created by leon on 2/16/18.
  */
@@ -11,7 +13,15 @@ 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 c : objectArray){
+            if(c.equals(objectToCount)){
+                counter++;
+            }
+        }
+
+        return counter;
     }
 
     /**
@@ -21,7 +31,19 @@ public static Integer getNumberOfOccurrences(Object[] objectArray, Object object
      * 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;
+
+        List<Object> resultList = new ArrayList<>();
+
+        for(Object obj : objectArray){
+            if(!obj.equals(objectToRemove)){
+                resultList.add(obj);
+            }
+        }
+
+
+
+
+        return resultList.toArray(Integer[] ::new);
     }
 
     /**
@@ -30,7 +52,31 @@ 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<Object, Integer> counMap = new HashMap<>();//Hashmap to store count of each object
+
+        //Iterate through array to count occurences of each object
+        for(Object object : objectArray){
+            if(counMap.containsKey(object)){
+                counMap.put(object, counMap.get(object)+1);
+            }
+            else counMap.put(object, 1);
+        }
+
+        //Variables to track the most frequent object and its counts
+        Object mostfreq = null;
+        int maxCount = 0;
+
+        //Iterate through the countMap to find the object with highest count
+        for (Map.Entry<Object, Integer> entry : counMap.entrySet()){
+            if(entry.getValue() > maxCount){
+                maxCount = entry.getValue();
+                mostfreq = entry.getKey();
+;            }
+        }
+
+        return mostfreq;
     }
 
 
@@ -40,7 +86,32 @@ 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;
+
+        Map<Object, Integer> counMap = new HashMap<>();//Hashmap to store count of each object
+
+        //Iterate through array to count occurences of each object
+        for(Object object : objectArray){
+            if(counMap.containsKey(object)){
+                counMap.put(object, counMap.get(object)+1);
+            }
+            else counMap.put(object, 1);
+        }
+
+        //Variables to track the most frequent object and its counts
+        Object minfreq = null;
+        int minCount = Integer.MAX_VALUE;
+
+        //Iterate through the countMap to find the object with highest count
+        for (Map.Entry<Object, Integer> entry : counMap.entrySet()){
+            if(entry.getValue() < minCount){
+                minCount = entry.getValue();
+                minfreq = entry.getKey();
+                ;            }
+        }
+
+
+
+        return minfreq;
     }
 
     /**
@@ -50,6 +121,29 @@ 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 lenght1 = objectArray.length;
+    int length2 = objectArrayToAdd.length;
+    int combinedLength = lenght1 + length2;
+
+    Object[] resultArray = Arrays.copyOf(objectArray, combinedLength);
+        System.arraycopy(objectArrayToAdd, 0, resultArray, lenght1, length2);
+
+
+
+//    //Calculate the length of the resulting array
+//    int mergedLlength = objectArray.length + objectArray.length;
+//
+//    //Create a new array with the calculated length
+//        Object[] mergedArray = new Object[mergedLlength];
+//
+//    //Copy elements from objectArrayToAdd to mergedArray
+//    System.arraycopy(objectArray, 0, mergedArray, 0, objectArray.length);
+//
+//    //Copy elements from objectArraytoAdd to mergedArry
+//        System.arraycopy(objectArrayToAdd, 0, mergedArray, objectArray.length, objectArray.length);
+
+
+        return resultArray ;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java b/src/main/java/com/zipcodewilmington/assessment1/part2/MultiplesDeleter.java
index a348b0d..5b657ff 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,16 @@ 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>oddList = new ArrayList<>();
+        for(Integer i : ints){
+            if(i % 2!=0){
+                oddList.add(i);
+            }
+        }
+
+        Integer[] answer = oddList.toArray(new Integer[oddList.size()]);
+
+        return answer;
     }
 
     /**
@@ -19,7 +31,19 @@ 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>evenList = new ArrayList<>();
+        for(Integer i : ints){
+            if(i % 2==0){
+                evenList.add(i);
+            }
+        }
+
+        Integer[] answer = evenList.toArray(new Integer[evenList.size()]);
+
+        return answer;
+
+
     }
 
     /**
@@ -28,7 +52,18 @@ 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>threeList = new ArrayList<>();
+        for(Integer i : ints){
+            if(i % 3!=0){
+                threeList.add(i);
+            }
+        }
+
+        Integer[] answer = threeList.toArray(new Integer[threeList.size()]);
+
+        return answer;
     }
 
     /**
@@ -38,6 +73,18 @@ 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>nList = new ArrayList<>();
+        for(Integer i : ints){
+            if(i % multiple!=0){
+                nList.add(i);
+            }
+        }
+
+        Integer[] answer = nList.toArray(new Integer[nList.size()]);
+
+        return answer;
+
+
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part2/StringUtils.java b/src/main/java/com/zipcodewilmington/assessment1/part2/StringUtils.java
index fc403e5..13744a9 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part2/StringUtils.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part2/StringUtils.java
@@ -11,7 +11,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[] strArray = sentence.split(" ");
+        return strArray;
     }
 
 
@@ -21,7 +23,9 @@ 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;
+
+
+        return sentence.substring(0, sentence.indexOf(" "));
     }
 
     /**
@@ -30,7 +34,15 @@ 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 string = getFirstWord(sentence);
+        String reversed = "";
+
+        for (int i = 0; i < string.length(); i++){
+            reversed = string.charAt(i) + reversed;
+        }
+
+
+        return reversed;
     }
 
     /**
@@ -39,7 +51,16 @@ 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 string = getFirstWord(sentence);
+        String camel = "";
+
+        for(int i =0; i <string.length(); i++){
+           camel = string.charAt(i) + camel;
+        }
+
+
+        return camel.substring(0,1).toUpperCase() + camel.substring(1);
     }
 
 
@@ -50,7 +71,12 @@ 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;
+
+        StringBuilder newStr = new StringBuilder(str);
+        newStr.deleteCharAt(index);
+
+
+        return newStr.toString();
     }
 
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/Animal.java b/src/main/java/com/zipcodewilmington/assessment1/part3/Animal.java
index 658bb25..84241a5 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part3/Animal.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Animal.java
@@ -5,4 +5,5 @@
  */
 public interface Animal {
     String speak();
+
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java b/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java
index e731b77..8553f69 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Cat.java
@@ -4,11 +4,22 @@
  * Created by leon on 2/16/18.
  */
 public class Cat extends Pet {
+
+
     /**
      * @param name name of this Cat
      * @param age age of this Cat
+     *
      */
+
+    private String name;
+    private int age;
+    private PetOwner owner;
+
     public Cat(String name, Integer age) {
+        this.name = name;
+
+        this.age = age;
 
     }
 
@@ -16,6 +27,9 @@ public Cat(String name, Integer age) {
      * @param age age of this Cat
      */
     public Cat(Integer age) {
+        this.name = "Cat name";
+        this.age = age;
+
     }
 
     /**
@@ -23,6 +37,7 @@ public Cat(Integer age) {
      */
     public Cat(String name) {
 
+        this.name = name;
     }
 
     /**
@@ -32,12 +47,36 @@ public Cat(String name) {
      * age is 0
      */
     public Cat() {
+        this.name = "Cat name";
+        this.age = 0;
     }
 
     /**
      * @return meow as a string
      */
     public String speak() {
-        return null;
+
+        return "Meow";
     }
+
+
+
+    @Override
+    public int getAge() {
+        return age;
+    }
+
+//    public void setAge(int age) {
+//        this.age = 0;
+//    }
+
+    @Override
+    public String getName() {
+        return name;
+    }
+
+//    public void setName(String name) {
+//
+//        this.name = "Cat name";
+//    }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java b/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java
index 0c775fd..712b06d 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Dog.java
@@ -8,20 +8,31 @@ public class Dog extends Pet {
      * @param name name of this Dog
      * @param age age of this dog
      */
+
+    private int age;
+    private String name;
+    private PetOwner petOwner;
+
     public Dog(String name, Integer age) {
 
+        this.name = name;
+        this.age = age;
+
     }
 
     /**
      * @param age age of this dog
      */
     public Dog(Integer age) {
+        this.name = "Dog name";
+        this.age = age;
     }
 
     /**
      * @param name name of this dog
      */
     public Dog(String name) {
+        this.name = name;
 
     }
 
@@ -32,12 +43,24 @@ public Dog(String name) {
      * age is 0
      */
     public Dog() {
+        this.name = "Dog name";
+        this.age = 0;
+
     }
 
     /**
      * @return bark as a string
      */
     public String speak() {
-        return null;
+
+
+        return "Bark";
+    }
+
+    public int getAge(){
+        return age;
+    }
+    public String getName(){
+        return name;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java b/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java
index 3c925da..914f6dd 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part3/Pet.java
@@ -1,5 +1,7 @@
 package com.zipcodewilmington.assessment1.part3;
 
+import java.security.acl.Owner;
+
 /**
  * Created by leon on 2/16/18.
  */
@@ -8,13 +10,20 @@ public abstract class Pet implements Animal {
      * nullary constructor
      * by default, pet has age of 0; name of "";
      */
+    private int age;
+    private String name;
+    private PetOwner petOwner;
+
     public Pet() {
+        this.age = 0;
+        this.name = "";
     }
 
     /**
      * @param name name of this pet
      */
     public Pet(String name) {
+        this.name = name;
     }
 
 
@@ -22,6 +31,7 @@ public Pet(String name) {
      * @param age age of this pet
      */
     public Pet(int age) {
+        this.age = age;
     }
 
     /**
@@ -29,20 +39,24 @@ 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 name ;
     }
 
     /**
      * @return age of this pet
      */
-    public Integer getAge() {
-        return null;
+    public int getAge() {
+
+        return age;
     }
 
     /**
@@ -50,12 +64,14 @@ public Integer getAge() {
      * ensure this instance of `Pet` is added to the owner's composite `pets` list
      */
     public void setOwner(PetOwner newPetOwner) {
+        this.petOwner = newPetOwner;
     }
 
     /**
      * @return PetOwner object whose composite `pets` collection contains this Pet instance
      */
     public PetOwner getOwner() {
-        return null;
+
+        return petOwner;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java b/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java
index 7bbf2ab..b6f4356 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part3/PetOwner.java
@@ -1,5 +1,9 @@
 package com.zipcodewilmington.assessment1.part3;
 
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
 /**
  * Created by leon on 2/16/18.
  */
@@ -7,14 +11,33 @@ public class PetOwner {
     /**
      * @param name name of the owner of the Pet
      * @param pets array of Pet object
+     *
      */
+    private String name;
+
+    private PetOwner petOwner;
+    private List<Pet> pets;
+
+
     public PetOwner(String name, Pet... pets) {
+        this.name = name;
+        this.pets = new ArrayList<>();
+
+        if(pets != null) {
+            for (Pet pet : pets) {
+                this.pets.add(pet);
+                pet.setOwner(this);
+            }
+        }
     }
 
     /**
      * @param pet pet to be added to the composite collection of Pets
      */
     public void addPet(Pet pet) {
+
+
+        pets.add(pet);
     }
 
     /**
@@ -22,6 +45,8 @@ public void addPet(Pet pet) {
      */
     public void removePet(Pet pet) {
 
+
+        pets.remove(pet);
     }
 
     /**
@@ -29,14 +54,24 @@ public void removePet(Pet pet) {
      * @return true if I own this pet
      */
     public Boolean isOwnerOf(Pet pet) {
-        return null;
+
+
+        return pets.contains(pet);
     }
 
     /**
      * @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 age= pets.get(0).getAge();
+        for(Pet pet : pets ){
+            //if this pet is younger update value of age
+            if(pet.getAge() < age){
+                age = pet.getAge();
+            }
+        }
+
+        return age;
     }
 
 
@@ -46,7 +81,18 @@ 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 age= pets.get(0).getAge();
+        for(Pet pet : pets ){
+            //if this pet is younger update value of age
+            if(pet.getAge() > age){
+                age = pet.getAge();
+            }
+        }
+
+        return age;
+
+
     }
 
 
@@ -54,27 +100,37 @@ 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 sum = 0;
+
+        for(Pet pet : pets){
+            sum += pet.getAge();
+        }
+
+        return (float) sum/pets.size();
     }
 
     /**
      * @return the number of Pet objects stored in this class
      */
     public Integer getNumberOfPets() {
-        return null;
+
+        return pets.size();
     }
 
     /**
      * @return the name property of the Pet
      */
     public String getName() {
-        return null;
+
+        return name;
     }
 
     /**
      * @return array representation of animals owned by this PetOwner
      */
     public Pet[] getPets() {
-        return null;
+
+        return pets.toArray(new Pet[pets.size()+1]);
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java b/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java
index f881e9c..7c41fe2 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part4/Jumper.java
@@ -6,6 +6,16 @@ public class Jumper {
      * Complete the function below.
      */
     public int jumps(int k, int j) {
-        return -1;
-    }
-}
+//        if(k < j){
+//            return k;
+//        }
+//
+//        else if (k % j == 0) {
+//            return k / j;
+//        } else {
+//
+//            return k / j + 1;
+//        }
+    return (k/j) + (k % j);
+   }
+}
\ No newline at end of file
diff --git a/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java b/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java
index 89e2016..3c94079 100644
--- a/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java
+++ b/src/main/java/com/zipcodewilmington/assessment1/part5/Palindrome.java
@@ -3,6 +3,29 @@
 public class Palindrome {
 
     public Integer countPalindromes(String input){
-        return null;
+
+        int size = input.length();
+        int count = 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)){
+                    count++;
+                }
+            }
+        }
+
+//        int n = input.length();
+//
+//        for (int i =0; i<(n/2); ++i){
+//            if(input.charAt(i) != input.charAt(n-i-1)){
+//                return null;
+//            }
+//
+//        }
+
+
+        return count ;
     }
 }