Intermediate Java Tutorial – 16 – HashSet

is this a hashmap?

Go ahead

There is one thing that bothers me.
Why do you every time use System.out.printf("%s", arg); and lane after u use System.out.println(); when you could just use once System.out.println(); with list, array or anything in it and it would just print it and go to new line. This way you have 2 lines of code instead of one for nothing.

Can't we convert Array to Set? instead converting Array to List and then list to Set.

– The HashSet subclass (from superclass Set) rearranges every element
– The LinkedHashSet subclass links with the elements and won't rearrange them

SHtring ;)))))

what about if you want to replace the 2nd bob with a new element.???
for example

Output : [apple, bob, ham, tomato, bacon]

ssssibilance

Hello Bucky,
my issue: the program removes the first instance of bob not the second :/

import java.util.*;

public class julian {
    public static void main(String[] args) {

       String[] things = {"apple", "bob", "ham", "bob", "bacon"};
        List<String> list = Arrays.asList(things);

        System.out.printf("%s ", list);
        System.out.println();

        Set<String> set = new HashSet<String>(list);
        System.out.printf("%s ", set);
    }
}

Can someone please explain me what's the difference in constructing the hashset object as:
HashSet<String> set = new HashSet<String>(list)
instead of
Set<String> set = new HashSet<String>(list) as shown in the tutorial?

For some reason I keep getting a compile error saying that HashSet is not generic.

But which bob did it remove?