Design a Hashset - LeetCode Interview Coding Challenge [Java Brains] 

Hi, are you planning for Design Patterns.. Looking forward to watch that playlist. Watched multiple videos of design patterns videos, but ur way of explaining is much better than those. Please do plan to crete one playlist for design patterns.

Thanks Koushik ,you really made it easy to understand the implementation of hashset .

Great explanation....Amazing. This channel certainly deserves more subscribers

Awesome! I was asked this in an interview.

Awesome as always!! Koushik please make a playlist on design patterns..!!

I truly appreciate the explanation!

it seems that the space complexity of the linkedlist implementation approaches O(N) as the number of elements approaches the max element count, and it still suffers from longer lookup times, so the advantage is lost with many elements. i guess the *real* advantage of that linkedlist implementation would be for situations when there aren't many elements...not to mention the fact that simple int key hashcode restricted to a short positive range is never seen irl, so an array of booleans is not realistic. xD as always, GREAT VIDEO! much thanks.

nice one

Thanks for the beautiful explanation

Hey Koushik. If you see this, I hope your day is going well. I just wanted to share an idea that I had for your channel. Wanted to run it by you to see what you think. You should add another "Join" tier/perk where members of said tier get to submit a topic of choice into a virtual submissions pool. Once a month (or weekly, bi-weekly, whatever you prefer) you draw a topic from the raffle and make a tutorial on it. Obviously, you would have to place constraints regarding acceptable content. I could see you benefiting greatly from this. If you were to implement a mid tier at ~$5, you would likely get quite a few new members. Especially if you decide to "shout out" the person whose topic is chosen in the resulting video. As an added bonus, you could spin a new series out of the ordeal. Off-the-cuff dev tutorials! I think these would likely end up being my favorite videos. IMPROV!!! I guarantee the audience response would be favorable. All in all, it seems like a win-win to me. It is at least worth trying out. I just came up with the idea, so, as far as I know, it is completely original on YT.

As usual, simple and crisp. Please make videos on system design.

this is the second I see you, and Im happy to see you, keep the good work

great dude.. it very simple to understand 👍🏻👏🏻

Absolutely helpful

Please a video on Design a HashMap (as most of the interviews I'm getting the question "What is the internal of HashMap")...

I m glad i came across your videos. Pls can you make videos for java for beginners too.. you hv all the content of hava just not the basics. Request to pls cover them too.

Hi sir, please do some series of tutorials of "collections " , waiting for your new collections playlist

delightful video

Nice video. Thanks

Hey there! I have really learnt a lot from the interview coding challenges and some of your other outputs. I am trying to obtain a role as a Java developer and have interviews set up. I have been through this entire playlist. Do you have another tips?

this man is everything

Hi sir..I am a big fan of you, please do a tutorial on how the IT industry does continuous integration and continuous deployment of the spring boot application.

Should rehashing decrease the number of buckets and readjust the hash table accordingly if we perform too many remove operations?

very simple explanation. Thank you so much!

Hello Kaushik, I hope you are doing good. Want to know how you are mapping with ipad with system. when you draw something. its showing simultaneously in the screen. Could you suggest how to do this.

Thank you!

How we can create a function to get the value at particular index which is send by user?

Really a nice vdo.. Can youplease share a vdo on Memory management in JAVA sir ? It will be really helpful .

Video Request: java 11 features introduced after java 8. Since it's the latest lts version would be good to know what's happening in Java world

Great

Space complexity on the simple solution is not O(n). Problem states there are at most 10k operations, so at most 10k adds, so n is 10k. But you'd be allocating way more than that.

Tutorial Request on: microservices communication using kafka

could you please make a video explaining how to make a Digest authentication with Jersey(JAX-RS) on java?

Hey nice explanation. How are you avoiding duplicates avoiding here?

Please provide video on hashmap implementation, thanks.

I love your videos. Thanks a lot for posting them. I have a query. In the list solution, while adding an element, it is being checked with only a specific bucket obtained of the hashed index. What if the element is already present in another bucket and never being checked? Wont that create duplicate elements to hashset which is contrary to behavior of hashset?

Sir please upload videos on Node and express js ,Your content is amazing and I didn't find any other thoughtful tutorial on node js other then yours ,So please sir make video on Node and express

Have been watching JB for 3 years now specificaly for Java. Started watching J2EE, Hibernate and Spring Boot playlists to get my first job, used the same for 2nd job. Then continued to microservices playlist for 3rd job now. For my 4th job, could you create playlists for Leetcode Top interview Qs and CTCI Chapter wise Qs? There are bits and pieces of these already online, but not even one is reliable to be the single point of contact. As an aspiring FAANG candidate, I hope I 'm raising the voices of many

Please start a DSA series

21:50 what if the key is not present but the childList is not null. It contains some other element. I think we should handle that case as well? e.g. 1001%100 = 1 but the bucket 1 contains 1901 which can be in the same bucket due to collisions. Am I missing something?

like before watching it ...

I was asked this question in an interview, I too used ArrayList but he clearly said that we cannot use any existing library to implement it. So can we implement this using simple array or some custom DS.

Didn't you take care to not add duplicates in hashset ?

Make a video on map and thread plzz

Why you didn't use MAX_VALUE mentioned as instance variable

You did not use this MAX_VALUE any where in the code then what was the purpose of its declaration ? private final int MAX_VALUE = 1000000;

I am using above code and in leetcode it is failing for one of the test case. After debugging, find out that, when I add 48 first time, it is creating index 48 and add on that. when i check contains(48) then it returns NULL, and i debug it and saw it that it stores at index 49, Is it because we used ArrayList and it is 0 based index?

what is the point of this interview question? isn't it reinventing the wheel?

@javabrains Hi Koushik, another nicely explained video, However, I have another solution by just taking a cue out your array solution, in the array solution, The solution wasn't efficient because of space complexity but we can reduce it by using bit array of the highest limit this way we'll require only those many bits space and time complexity will also be of O(1). What do you think?

Thanks a lot, sir

Need video series on design patterns

Why LinkedList and not List?

Just wrap HashMap, that is how HashSet works. It is not using HashSet ;) It is not even using a Set

LPT: Simple implementation is like a programming joke. do not seriously give that to interviewer as final solution, you can joke about it, but not as final solution. ;) Because the main problem "Hash" concepts solve is lack of sequential memory. It aims to strike a balance between lack of sequential memory in array implementation and having to traverse through all values in linked list