diff --git a/src/main/java/com/zipcodewilmington/assessment2/part1/BasicUtilities.java b/src/main/java/com/zipcodewilmington/assessment2/part1/BasicUtilities.java index 1402353..8aedef9 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part1/BasicUtilities.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part1/BasicUtilities.java @@ -2,18 +2,39 @@ 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 == 0 || valueToEvaluate % 6 == 0 || valueToEvaluate % 7 == 0) && (valueToEvaluate != 0)) { + return true; + + } else { + return false; + } } + public Boolean startsWith(String string, Character character) { - return null; + char[] result = string.toCharArray(); + for (int i = 0; i < string.length(); i++) + if (result[0] == character || result[0] == character.toUpperCase(character)) + return true; + 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..e16677b 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part1/IntegerArrayUtilities.java @@ -1,19 +1,38 @@ package com.zipcodewilmington.assessment2.part1; +import java.util.ArrayList; +import java.util.Arrays; +import java.util.List; +import java.util.stream.IntStream; + public class IntegerArrayUtilities { public Boolean hasEvenLength(Integer[] array) { - return null; + if (array.length % 2 == 0) + return true; + + return false; } + public Integer[] range(int start, int stop) { - return null; - } + List result = new ArrayList<>(); + for (int i = start; i <= stop; i++) { + result.add(i); + } - public Integer getSumOfFirstTwo(Integer[] array) { - return null; - } + Integer[] finalResult = new Integer[result.size()]; + for (int i = 0; i < result.size(); i++) { + finalResult[i] = result.get(i); + } + return finalResult; - public Integer getProductOfFirstTwo(Integer[] array) { - return null; - } } + + public Integer getSumOfFirstTwo ( Integer[]array){ + return array[0] + array[1]; + } + + public Integer getProductOfFirstTwo ( Integer[]array){ + return array[array.length - 1] * array[array.length - 2]; + } + } diff --git a/src/main/java/com/zipcodewilmington/assessment2/part1/WuTangConcatenator.java b/src/main/java/com/zipcodewilmington/assessment2/part1/WuTangConcatenator.java index 63f210e..a48e762 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part1/WuTangConcatenator.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part1/WuTangConcatenator.java @@ -1,18 +1,22 @@ package com.zipcodewilmington.assessment2.part1; public class WuTangConcatenator { + private Integer input; + + public WuTangConcatenator(Integer input) { + this.input = input; } public Boolean isWu() { - return null; + return input % 3 == 0; } public Boolean isTang() { - return null; + return input % 5 == 0; } public Boolean isWuTang() { - return null; + return isWu() && isTang(); } } diff --git a/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java b/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java index de2f799..f67708f 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part2/ArrayUtility.java @@ -2,18 +2,52 @@ public class ArrayUtility { public Integer[] merge(Integer[] array1, Integer[] array2) { - return null; + int lengthOne = array1.length; + int lengthTwo = array2.length; + Integer[] result = new Integer[lengthOne + lengthTwo]; + + System.arraycopy(array1, 0, result, 0, lengthOne); + System.arraycopy(array2, 0, result, lengthOne, lengthTwo); + return result; } + public Integer[] rotate(Integer[] array, Integer index) { - return null; + Integer[] result = new Integer[array.length]; + for (int i = 0; i < array.length; i++) { + result[( i + array.length - index ) % array.length] = array[i]; + } + return result; } + public Integer countOccurrence(Integer[] array1, Integer[] array2, Integer valueToEvaluate) { - return null; + Integer counter = 0; + for (int i = 0; i < array1.length && i < array2.length; i++) + if (valueToEvaluate == array1[i] || valueToEvaluate == array2[i]) + counter++; + + return counter; + } public Integer mostCommon(Integer[] array) { - return null; + Integer count = 1, tempCount; + Integer mostCommon = array[0]; + Integer temp = 0; + for (int i = 0; i < array.length - 1; i++) { + temp = array[i]; + tempCount = 0; + for (int j = 1; j < array.length; j++) + if (temp == array[j]) + tempCount++; + + if (tempCount > count) { + mostCommon = temp; + count = tempCount; + } + } + return mostCommon; } } + diff --git a/src/main/java/com/zipcodewilmington/assessment2/part2/ListUtility.java b/src/main/java/com/zipcodewilmington/assessment2/part2/ListUtility.java index e978685..b5ecab2 100644 --- a/src/main/java/com/zipcodewilmington/assessment2/part2/ListUtility.java +++ b/src/main/java/com/zipcodewilmington/assessment2/part2/ListUtility.java @@ -1,29 +1,36 @@ package com.zipcodewilmington.assessment2.part2; - +import java.lang.reflect.Array; +import java.util.ArrayList; +import java.util.HashSet; import java.util.List; + public class ListUtility { + private List list = new ArrayList<>(); public Boolean add(int i) { - return null; + return list.add(i); } public Integer size() { - return null; + return list.size(); } public List getUnique() { - return null; + return new ArrayList<>(new HashSet<>(list)); } public String join() { - return null; + String result = list.toString(); + return result.substring(1, result.length()-1); } + public Integer mostCommon() { - return null; + ArrayUtility arrayUtility = new ArrayUtility(); + return arrayUtility.mostCommon(list.toArray(new Integer[0])); } public Boolean contains(Integer valueToAdd) { - return null; + return list.contains(valueToAdd); } }