Part A:
1. The first problem is to count the number of even and odd elements in an array of integers. The next problem is to place them into an array of length 2. Then, return the array with the elements.

2. The linear search will be helpful because its meant for finding specific values.

3. public static int[] evenOdds(int[] values) { // your work here int[] myArray = new int[2]; for (int element: values) { if (element % 2 == 0) { myArray[0]++; } else { myArray[1]++; } } return myArray; }
4. You do not have to compute both

5. public static int[] evenOdds(int[] values) { // your work here int[] myArray = new int[2]; for (int element: values) { if (element % 2 == 0) { myArray[0]++; } else { myArray[1]++; } } return myArray; }

Part B:
1. I will remove the duplicates by checking the word before it. If it is the same as the current word, remove the current word. When I find them, i will remove them.

2. Done.

3. Yes, all the tests passed.

4. public void removeAdjacentDuplicates() { // your code here for (int i = 1; i < words.size(); i++) { if (words.get(i).equals(words.get(i - 1))) { words.remove(i); i--; } } }

5. Done.

6. Done.

7. Yes I finally passed all the tests.

8. public void removeAllDuplicates() { for (int i = 0; i < words.size(); i++) { for (int j = i + 1; j < words.size(); j++) { if