Apparently I keep getting an error $(1\mathrm{.}1\mathrm{.}9).$ Please check the code to make sure that the functions are compatible and can run under $10$ seconds. I have tried to find the cause but apprently lines $29,52$ and $120$ seem to be the cause for the error to occur.

For this problem set, you will submit a single java file named Homework.java. You are supposed to add the functions described below to your Homework class. The functional signatures of the functions you create must exactly match the signatures provided below. You are not allowed to use any $3$rd party libraries in the homework assignment. When you have completed your homework, upload the Homework.java file to Grader Than. All tests will timeout and fail if your code takes longer than $10$ seconds to complete.

Remove Duplicates

This function will receive a list of elements with duplicate elements, this function should remove the duplicate elements in the list and return a list without duplicate elements. The elements in the returned list must be in the same order that they were found in the list the function received. A duplicate element is an element found more than one time in the specified list.

Signature:

public static ArrayList$2,4,5,3,3,5,22,4,5,3$

This function will receive a list of elements with duplicate elements. It should add all of the duplicate elements to a set and return the set containing the duplicate elements. A duplicate element is an element found more than one time in the specified list. The order of the set does not matter.

Signature:

public static HashSet $2,4,5,3,3,5$

OUTPUT: $\{5,3\}$

Remove Char

This function will be given a list of strings and a character. You must remove all occurrences of the character from each string in the list. The function should return the list of strings with the character removed.

Signature:

public static ArrayListlist;

Example:

list: $[\text{'}$adndj$\text{'},$ 'adjdlaa', $\text{'}$aa$\text{'},$ 'djoe'$]$

pattern: a

Output: $[\text{'}$dndj$\text{'},\text{'}$djdl$\text{'},",$ 'djoe'$]$

Return Growing NumList

This function will be given a single number, it should return a list of strings of numbers. Each string in the list will only contain a single number repeated an arbitrary amount of times. The number each string will contain will be equal to the current string's index $+1.$ The number in the string should be repeated the same number of times as the string's index $+1.$ Each number in the string should be separated by a space. This list should stop when its size equals the max number specified.

Signature:

public static ArrayList $1,22,333$

OUTPUT: $1,22,333,4444,55555,666666$

Unique Values

This function will receive a single map parameter known as a$\_$map. a$\_$map will contain a single letter as a string and numbers as values. This function is supposed to search a$\_$map to find all values that appear only once in a$\_$map. The function will create another map named to$\_$ret. For all values that appear once in a$\_$map the function will add the value as a key in to$\_$ret and set the value of the key to the key of the value in a$\_$map $($swap the key$-$value pairs, since a$\_$map contains letters to numbers, to$\_$ret will another map named to$\_$ret. For all values that appear once in a$\_$map the function will add the value as a key in to$\_$ret and set the value of the key to the key of the value in a$\_$map $($swap the key$-$value pairs, since a$\_$map contains letters to numbers, to$\_$ret will contain Numbers to Letters$).$ Finally, the function should return to$\_$ret.

Signature:

public static HashMap$\{0=M,2=M,3=M,5=M,6=n,7=M,9=M\}\{n=6\}$

INPUT: $\{0=A,1=c,2=c,4=c,5=a,8=Q,9=c\}$

OUTPUT: $\{A=0,a=5,Q=8\}$

Concatenate Map

This function will be given a single parameter known as the Map List. The Map List is a list of maps. Your job is to combine all the maps found in the map list into a single map and return it$.$ There are two rules for adding values to the map.

You must add key$-$value pairs to the map in the same order they are found in the Map List. If the key already exists, it cannot be overwritten. In other words, if two or more maps have the same key, the key to be added cannot be overwritten by the subsequent maps.

Signature:

public static HashMap$\{b=55,t=20,f=26,n=87,o=93\},\{s=95,f=9,n=11,o=71\},\{f=89,n=82,o=29\}$

INPUT: $\{v=2,f=80,z=43,k=90,n=43\},\{d=41,f=98,y=39,n=83\},\{d=12,v=61,y=44,n=30\}$

OUTPUT: $\{d=41,v=2,f=80,y=39,z=43,k=90,n=43\}$

INPUT: $\{p=79,b=10,g=28,h=21,z=62\},\{p=5,g=87,h=38\},\{p=29,g=44,x=59,y=8,z=82\}$

OUTPUT: $\{p=79,b=10,g=28,h=21,x=59,y=8,z=62\}$