Java HashSet Tutorial

[lokinasthenerd]

You just saved me hours of reasearch through barely understandable material, you're a life saver!!! Thank you! Your teaching style is really great and exactly what I need as a newbie!

[anwarulbashirshuaib]

This channel is so underrated. I just watched a video(won't name the channel) in which the guy just said, "The elements are hashed everywhere, so it's called HashSet". This freaked me out! Trevor knows what he is talking about, unlike some other guys who don't.

[EmadElSammad]

Thanks for paying attention to details and breaking down everything for us to understand. Not many instructors do that like you do. I just subscribed because of your analytical teaching.

[alexschmidt]

Trevor, you are a true legend of all time. I am watching in 2019 and by far the old 2015 video still the one that helped me out. I like your style, please continue.

[mishalubich]

Well done — simple to understand a concept in such a short amount of time.

[letoatreides]

Hi and thank you for the video. I'm wondering why we don't write: HashSet<Integer> mySet = new HashSet<Integer>();
Is it just by convention that it's good practice to show that HashSet is an implementation of the Interface Set?
And that it's not some other class?

[rebeccamonroy]

Good video, now I know how HashSet works

[cuanhap]

Thank you. Your video is so great to me.

[manimanu]

can you please explain hashset algorithm that does not allow duplication and also it give us values in unorder form

[harshable]

Its not explaining internal implementation of HashSet

[CribsNL]

Thanks for explainging this datastucture really got a better understanding now of Set and Hash Algorithm.

[huseyinavnikadoglu]

You helped me so much, Thanks Trevor!

[syedwaseemahmed]

Yes, this is an old topic, but I still have some confusions.

In Java, people say:

1)ArrayList is faster than LinkedList if I randomly access its elements. I think random access means "give me the nth element". Why ArrayList is faster?
2)LinkedList is faster than ArrayList for deletion. I understand this one. ArrayList's slower since the internal backing-up array needs to be reallocated. A code explanation:
List<String> list = new ArrayList<String>();
list.add("a");
list.add("b");
list.add("c");
list.remove("b");
//output "c"
3)LinkedList is faster than ArrayList for insertion. What does insertion mean here? If it means to move some elements back and then put the element in the middle empty spot, ArrayList should be slower than LinkedList. If insertion only means an add(Object) operation, how could this be slow?

[darshan]

what ide do you use? those little boxes with return types and parameters send really helpful.

[darklen]

You can use a TreeSet to go into order

[programmingandrew]

what kind of tool you use for teaching?

[pravalikakarlam]

I'm unable get the hashing algorithm

[Akanksha]

amazing video and explanation to the point☺☺☺☺

[rayprusia]

Great video, i will be watching more!

[sebneminegol]

Thank you so much. It is a simple and clear explanation.