diff --git a/src/main/java/com/zipcodewilmington/assessment2/part1/BasicUtilities.java b/src/main/java/com/zipcodewilmington/assessment2/part1/BasicUtilities.java
index 1402353..88b628b 100644
--- a/src/main/java/com/zipcodewilmington/assessment2/part1/BasicUtilities.java
+++ b/src/main/java/com/zipcodewilmington/assessment2/part1/BasicUtilities.java
@@ -1,19 +1,42 @@
 package com.zipcodewilmington.assessment2.part1;
 
 public class BasicUtilities {
+
+
     public Boolean isGreaterThan5(Integer value) {
-        return null;
+        if(value >= 5){
+            return true;
+        }else{
+            return false;
+        }
     }
 
     public Boolean isLessThan7(Integer value) {
-        return null;
+        if(value <= 7){
+            return true;
+        }else{
+            return false;
+        }
     }
 
     public Boolean isBetween5And7(Integer valueToEvaluate) {
-        return null;
+        if(valueToEvaluate >= 5 && valueToEvaluate <=7){
+            return true;
+        }else{
+            return false;
+        }
     }
 
     public Boolean startsWith(String string, Character character) {
-        return null;
+        Character first = string.charAt(0);
+
+        if(first.toString().toUpperCase().equals(character.toString().toUpperCase())){
+            return true;
+        }else if(first.toString().toLowerCase().equals(character.toString().toLowerCase())){
+            return true;
+        }else {
+            return false;
+        }
+
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java b/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java
index a360000..cc190a3 100644
--- a/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java
+++ b/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java
@@ -1,19 +1,39 @@
 package com.zipcodewilmington.assessment2.part1;
 
+import com.j256.ormlite.stmt.query.In;
+
 public class IntegerArrayUtilities {
     public Boolean hasEvenLength(Integer[] array) {
-        return null;
+
+
+        if(array.length % 2 == 0){
+            return true;
+        }else {
+            return false;
+        }
     }
 
     public Integer[] range(int start, int stop) {
-        return null;
+
+        Integer[] answer = new Integer[stop - start +1];
+        int index = 0;
+        for(Integer  x = start; x <= stop; x++){
+            answer[index] = x;
+            index++;
+        }
+        return answer;
     }
 
     public Integer getSumOfFirstTwo(Integer[] array) {
-        return null;
+
+        Integer first = array[0];
+        Integer second = array[1];
+        return first + second;
     }
 
     public Integer getProductOfFirstTwo(Integer[] array) {
-        return null;
+        Integer last = array[array.length -1];
+        Integer secondToLast = array[array.length -2];
+        return last * secondToLast;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment2/part1/WuTangConcatenator.java b/src/main/java/com/zipcodewilmington/assessment2/part1/WuTangConcatenator.java
index 63f210e..cfbd4fc 100644
--- a/src/main/java/com/zipcodewilmington/assessment2/part1/WuTangConcatenator.java
+++ b/src/main/java/com/zipcodewilmington/assessment2/part1/WuTangConcatenator.java
@@ -1,18 +1,35 @@
 package com.zipcodewilmington.assessment2.part1;
 
 public class WuTangConcatenator {
+
+    Integer input;
+
     public WuTangConcatenator(Integer input) {
+        this.input = input;
     }
 
     public Boolean isWu() {
-        return null;
+
+        if(this.input % 3 == 0){
+            return true;
+        }else {
+            return false;
+        }
     }
 
     public Boolean isTang() {
-        return null;
+        if(this.input % 5 == 0){
+            return true;
+        }else {
+            return false;
+        }
     }
 
     public Boolean isWuTang() {
-        return null;
+        if(this.input % 3 == 0 && this.input % 5 == 0){
+            return true;
+        }else {
+            return false;
+        }
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java b/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java
index de2f799..801c645 100644
--- a/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java
+++ b/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java
@@ -1,19 +1,84 @@
 package com.zipcodewilmington.assessment2.part2;
 
 public class ArrayUtility {
+
+
     public Integer[] merge(Integer[] array1, Integer[] array2) {
-        return null;
+
+        Integer[] newArr = new Integer[array1.length + array2.length];
+
+        int indx = 0;
+        for(Integer element : array1){
+            newArr[indx] =  element;
+            indx++;
+        }
+
+        for( Integer element : array2){
+            newArr[indx] =  element;
+            indx++;
+        }
+        return newArr;
     }
 
     public Integer[] rotate(Integer[] array, Integer index) {
-        return null;
+        Integer[] subArr1 = new Integer[index];
+
+        for(int x = 0; x < index; x++){
+            subArr1[x] =  array[x];
+        }
+
+        int indx = 0;
+        Integer[] subArr2 = new Integer[array.length - index];
+        for(int x = index; x <= array.length -1; x++){
+            subArr2[indx] =  array[x];
+            indx++;
+        }
+
+
+        return merge(subArr2 , subArr1);
     }
 
     public Integer countOccurrence(Integer[] array1, Integer[] array2, Integer valueToEvaluate) {
-        return null;
+
+        Integer count = 0;
+        for(Integer element : array1){
+            if(element == valueToEvaluate){
+                count++;
+            }
+        }
+        for(Integer element : array2){
+            if(element == valueToEvaluate){
+                count++;
+            }
+        }
+
+        return count;
     }
 
     public Integer mostCommon(Integer[] array) {
-        return null;
+
+        Integer currentHighest = array[0];
+        Integer highestCount = 0;
+
+        if(array.length == 1){
+            return array[0];
+        }else{
+
+            for(int x = 0; x<= array.length -1; x++){
+                Integer countIn = 0;
+                for(int z = 0; z <= array.length -1; z++){
+                    if(array[x] == array[z]){
+                        countIn ++;
+                    }
+                }
+                if(countIn > highestCount){
+                    currentHighest = array[x];
+                    highestCount = countIn;
+                }
+            }
+
+        }
+
+        return currentHighest;
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment2/part2/ListUtility.java b/src/main/java/com/zipcodewilmington/assessment2/part2/ListUtility.java
index e978685..4e3f408 100644
--- a/src/main/java/com/zipcodewilmington/assessment2/part2/ListUtility.java
+++ b/src/main/java/com/zipcodewilmington/assessment2/part2/ListUtility.java
@@ -1,29 +1,89 @@
 package com.zipcodewilmington.assessment2.part2;
 
+import com.j256.ormlite.stmt.query.In;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.HashMap;
 import java.util.List;
 
 public class ListUtility {
-    public Boolean add(int i) {
-        return null;
+
+    ArrayList<Integer> listOfNums = new ArrayList<>();
+
+    public boolean add(int i) {
+
+        if((Integer)i == null){
+            return false;
+        }else{
+            this.listOfNums.add(i);
+            return true;
+        }
     }
 
     public Integer size() {
-        return null;
+        return this.listOfNums.size();
     }
 
     public List<Integer> getUnique() {
-        return null;
+
+        ArrayList<Integer> holder = new ArrayList<>();
+        HashMap<Integer , Integer> hashy = new HashMap<>();
+        for (int i = 0; i < listOfNums.size(); i++) {
+            if (!hashy.containsValue(listOfNums.get(i))){
+                holder.add(listOfNums.get(i));
+                hashy.put(listOfNums.get(i), i);
+            }else {
+                hashy.put(listOfNums.get(i), i);
+            }
+        }
+        Integer[] answer = new Integer[hashy.size()];
+        int index = 0;
+        for(Integer element : hashy.keySet()){
+            answer[index] = element;
+            index++;
+        }
+        List<Integer> answer2 = Arrays.asList(answer);
+        return answer2;
     }
 
     public String join() {
-        return null;
+        String temp = "";
+
+        if(listOfNums.size() == 1){
+            temp += listOfNums.get(0);
+        }else {
+            int count =0;
+            for(Integer element : listOfNums){
+                if(count == 0){
+                    temp += element;
+                    count++;
+                }else {
+                    temp += ", " + element;
+                }
+            }
+        }
+
+        return temp;
     }
 
     public Integer mostCommon() {
-        return null;
+        Integer[] holder = new Integer[listOfNums.size()];
+        int indx = 0;
+        for(Integer elelment : listOfNums){
+            holder[indx] = elelment;
+        }
+
+        ArrayUtility temp = new ArrayUtility();
+        Integer answer = temp.mostCommon(holder);
+        return answer;
     }
 
     public Boolean contains(Integer valueToAdd) {
-        return null;
+        if(this.listOfNums.contains(valueToAdd)){
+            return true;
+        }else {
+            return false;
+        }
     }
 }
diff --git a/src/main/java/com/zipcodewilmington/assessment2/part3/Animal.java b/src/main/java/com/zipcodewilmington/assessment2/part3/Animal.java
index 2199ccd..00c0791 100644
--- a/src/main/java/com/zipcodewilmington/assessment2/part3/Animal.java
+++ b/src/main/java/com/zipcodewilmington/assessment2/part3/Animal.java
@@ -5,3 +5,4 @@ public interface Animal {
     int getSpeed();
     String color();
 }
+//List<Integer> answer = Arrays.asList(holder);