What is a HashSet? | Data Structures | Easy explanation with animations | Study Algorithms

Подписаться 36 тыс.

Просмотров 4 тыс.

50% 1

A HashSet data structure gives you two prime advantages: handling duplicates and speed. This makes it really special and very important for your interviews. Watch this video to understand what is exactly a HashSet, what is an iterator and the operations you can perform on it. All of this with animations and also a demo run in JAVA.
Chapters:
00:00 - Intro
00:56 - Basic overview
01:57 - What is a HashSet?
03:23 - Operations on a HashSet
06:39 - Working Demo in JAVA
09:28 - What is an Iterator?
12:03 - Final Thoughts
📚 Links to topics I talk about in the video:
Array Data Structure: • Array Data Structure e...
Linked List: • Linked List Data Struc...
Stack Data Structure: • Stack Data Structure e...
Queue Data Structure: • Queue Data Structure e...
📘 A text based explanation is available at: studyalgorithms.com
Code on Github: github.com/nikoo28/java-solut...
📖 Reference Books:
Starting Learn to Code: amzn.to/36pU0JO
Favorite book to understand algorithms: amzn.to/39w3YLS
Favorite book for data structures: amzn.to/3oAVBTk
Get started for interview preparation: amzn.to/39ysbkJ
🔗 To see more videos like this, you can show your support on: www.buymeacoffee.com/studyalg...
🎥 My Recording Gear:
Recording Light: amzn.to/3pAqh8O
Microphone: amzn.to/2MCX7qU
Recording Camera: amzn.to/3alg9Ky
Tablet to sketch and draw: amzn.to/3pM6Bi4
Surface Pen: amzn.to/3pv6tTs
Laptop to edit videos: amzn.to/2LYpMqn
💻 Get Social 💻
Follow on Facebook at: / studyalgos
Follow on Twitter at: / studyalgorithms
Follow on Tumblr at: / studyalgos
Subscribe to RSS feeds: studyalgorithms.com/feed/
Join fan mail: eepurl.com/g9Dadv
#hashset #datastructure #interview

Опубликовано:

1 июн 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 15

@ukaszkiepas57 3 месяца назад

Thank you bro. Clean explenation :) Helped me a lot!

@raghavsyt Год назад

This is Gold!

@puriatc1089 3 дня назад

ok but , how it uses hashing to do all this operations in O(1) time complexity? thats what i wanted to know :(

@fiskfisk33 Год назад

O(1) for deleting an element in an array is debatable, if you want to move the above elements down to fill the gap it gets slower.

@ET-Programming 10 месяцев назад

deleting an element from an Array is o(1) only for if the element is the last element on the array ,so if i want to remove an element from middle it is o(n) ,

@nikoo28 9 месяцев назад

in an array, you can go straight to an index. That means O(1)

@amruthaj4262 3 месяца назад

I just wanna know, is the time complexity O(1) for a Linked List at the head and tail?

@nikoo28 2 месяца назад

to add an element at the tail of the linked list, the time complexity is O(n). to add at the head, the time complexity is O(1)

@amruthaj4262 2 месяца назад

@@nikoo28Thank you

@anmolverma075 Год назад

Sir , where can I contact you? I need some help.

@nikoo28 Год назад

Check the channel description, you will find an email address to reach out. You can also comment here

@anmolverma075 Год назад

I cannot sir. Can we talk on LinkedIn or Discord/Twitter?

@nikoo28 Год назад

Send me an email

@saiprasad5779 Год назад

How it different from dictionary

@nikoo28 Год назад

It is almost the same as a dictionary…the major difference is that a hashset is synchronised (works good in a multi threading code) The use of Dictionary is now kind of obsolete and deprecated. You are not advised to use a Dictionary