Design HashSet | EP 8

[@theOmKumar]

1st method : we're only using zeros and ones, so it's better to make vector m; it saves lots of memory!

[@darkelixir2517]

Well noticed! good idea to create a boolean array

[@shivangisharma3690]

You are so so good at teaching, you cleared all my doubts till date I wonder who else explains it so well

[@PardeepSingh-cf8lf]

it took me hardly 25 -30 minutes to get at 8 episodes of this serios Nd thanks a lot sir for uploaded amazing lectures

[@raghvendrakhatri5848]

Lect - 9 completed, sir love♥️ the way you explain each and every concept, please keep creating such wonderful content 💯 your playlist are helping me alot in understanding the topics and improving my skills. Thankyou bhaiya ♥️

[@rajyadav1337]

Within a day I'm almost very much confident about linkedList Sir. Thank you so much for providing so a wonderful contents. Keep motivating Sir.

[@mohitroshan3856]

It took 3hrs to reach EP 8. Less time , More concepts❤️‍🔥

[@amt.7rambo670]

what ijust took 2 hours

[@UCSNRohit]

Yahi chahiye tha mujhe, boht confusing laga khud se padhne me, thnk you bhaiya!😍

[@datasciencemlai8330]

badhiya series hai dada, much better than 1, 2 hours coz this content is crisp

[@deepakdass4710]

Yesterday, I started this and watched 7 episodes then practiced about 10-12 probles on GFG and LC. Now, I am starting this from the 8th EP

[@beinghappy9223]

Best video on design hashset till date

[@rameshkhed7864]

It took 1.30 hour to reach EP 8 ... U will easily clear concept so not hard to understand LL👍👍

[@swarnimkamal2210]

maza aarha hain bhaiya , mera list bahut weak but thnx to you ab kaafi behtar horha hain, thnx:)

[@technicalteam3298]

just about 2 hours because you keeps the things interesting

[@akshyagarg2398]

kaafi acha sikahaya bhaiya ek dum clear

[@darkelixir2517]

took 2hours to reach this, learning new stl will need 1 hour more, so far so good

[@BG-lj6fw]

2-3 hrs....simultaneously taking notes and submitting solution on LC, CS

[@utkarshsingh5390]

sabse bhadiya line thi bhaiyaa ki "search karlena hash functions kaafi difficult functions aajayenge unko use karlena"😀😂

[@mohammadfraz]

😂😂

[@akashgola2153]

Awesome Explanation 😍😍, Took sometime for the first time though.

[@sahiljain2524]

Very good video and learn the new concept of linkedlist thank you

[@areebahmadsiddiqui2648]

Mujhe 20 min hi laga lol Kal hi maine Linked List start kiya tha aur aj ap poori playlist leke a gae

[@mohammadfraz]

😂 bahot badhiya , chalo ahh complete krlo jldi se

[@ankur_6174]

It took me 1 hr to reach here. Bcoz saare problems kr rkhe the pehle se.

[@divyareddy7622]

bhaiya dry running the approach before code, during code and after code is the best explaination! please try to dry run more! thanks a lot!!!

[@desihiphop4998]

Bhut tgda bhut tgda bhaiya 2 hr laga 8th episode tk !!!! ❤️❤️

[@mohammadfraz]

12th is also uploaded

[@desihiphop4998]

@@mohammadfraz bilkul bhiya cheack maarunga !!!!!!!

[@adityaroychowdhury3709]

correct me if i understood wrong- this hashset, is just a 2D array, where 1Dimension is a vector and another D is a linked list branching out from each unit of the vector

[@tanmoychowdhury5170]

right

[@jobanpreetsingh2370]

Bhaarii concept 😮😮

[@mohammadfraz]

🔥

[@naziyakhan4096]

this is my 2nd day i started watching from 7th video today

[@noobprogrammer3040]

Maza aagya bhaiya iss series me. LOVED IT ! please agli series dp ya recursion par laao aisi hi.

[@mohammadfraz]

Or episodes dal diye

[@ayushop1921]

@@mohammadfraz kha bhaiya apne 30 bola tha 25 hi hai

[@TOUR__OF__UNIVERSE]

​@@mohammadfrazbhai ka mein c++ ke saare functions seekh kar software engineer ban sakta hoon? Please bataiye.

[@d.aditya1398]

dsa imp h@@TOUR__OF__UNIVERSE

[@ashyy346]

Best explanation ever, thanks a lot sir!

[@vibhaypandey9650]

Amazing series man and explanation is very much understandable and hats off your hardwork

[@adityavaste8963]

Thanks for wonderful playlist. ( It took 2 hours )

[@aditiranjan303]

Your explanation is too good.. pls make such series for other topics too...

[@ujjwaltiwari6166]

Acche se rivision ho raha bhaiya , thanku bhaiya

[@mohammadfraz]

Keep watching and sharing

[@googleit2490]

Understood :) Oct'4, 2023 04:22 pm

[@jay8118]

New to the channel...Explanation is great..Please continue making more

[@omchaudhari3576]

Nice Explanation ☺️. I think we can also use vector instead of Linked List...

[@79rajeevsharma42]

Pehle ke sare lectures to samjh aaye hai achhe se, but ye wala bahut confusing tha, same video, c programming pe bana dijiye

[@crushtech1362]

In a Day reach here, day yet not end

[@stite1191]

It took me 3 hours as I was doing questions in java and cpp both.

[@shyaamaltripathi5373]

Bhaiyya the series is really good ! keep going

[@anchalchaturvedi773]

Loving this series bhaiya 👍👍

[@ss-md4qn]

Superb ,thanks

[@dp-ev5me]

Sir thumbnail me bohot achhe lag rahe ho. Thank you for the guidance.

[@mohammadfraz]

Are thank you so much

[@khushboosaraf2375]

Thank you for the videos.

[@satyamjaiswal1222]

In the worst case for search operation, it will take O(n) time. I think we can do search operation in O(L) time by trie where L is total digits in that number.

[@darkelixir2517]

But using trie will complicate things, cuz most of us here learning LL

[@vxbsjisjjdjjdn]

dear fraz bhaiya please add please add sub-titles for linked list playlist. And congratulations for cracking the google.

[@vasuarora8775]

mast series bhaiya 💙💙💙💙💙💙

[@mohammadfraz]

Thanks Vasu

[@mycam9364]

In java we can use boolean array instead of using vector right.

[@ratnasanjay]

Thankyou bhaiya for this video

[@shyamaharihar2425]

Nice explanation

[@suryaprakash1890]

Just 2 days to reach here!!🖐️💗

[@NITianMonika]

aaram aaram se dekha hai 3rd day hai aaj🙂🙂🥲

[@Ayush-jz5um]

How will we check if hashset is empty or not? Can i say if even a single element of vector is 1 then hashset is not empty?

[@dishagupta7446]

one que hashset is supposed to have O(1) time complexity. Doesn't 2nd approach makes it O(N)

[@vivekpanchaal]

1 din lga lec8 per aane ke liye

[@vaibhavtale318]

thank you soo much ..

[@shwetanshusood9450]

Got into 8th episode in 1 hour

[@kunalyewale7495]

episode 8 done

[@kunalyewale7495]

nice

[@tanmaythaker2905]

Sir loving your content! 50K soon!

[@mohammadfraz]

Hope so! will provide quality content ❤️🔥

[@saurabhnayak3352]

@@mohammadfraz yes soon.

[@mohammadrobass]

If you search for a key that is at the end of the list, the 'contain' function should return true, but currently, it returns false.

[@christlikelife6675]

Will there be any change in the efficiency of code if I use a 2D vector instead of a linked list??

[@nilayarya7634]

no

[@ritikgoyal3622]

Great 👍 job bhaiya

[@mohammadfraz]

Thanks bro

[@mdnadeem6343]

musch needed video thanks bhaiya

[@mohammadfraz]

Welcome bro , please share also

[@sudhanshuranjan4392]

And even if our hash function is good still there is a chance of collision. Suppose we have 10000 elements and only 1, 13 and 11 collides and we try to search for 11 it will take O(n) time. So when we say that hash set takes constant time does it means that we are talking about average time??

[@hanuuhanooo7111]

Good content keep uploading

[@mohammadfraz]

Haan bilkul , keep supporting

[@stite1191]

Can you make a 5 to 10 min video submitting it in java. explaining the implementation part.

[@shouvikdatta6831]

Can you mention the time and space complexity of add, remove and contains function while chaining..?

[@AB-tp9eg]

Sir, What is the time complexity & space complexity?

[@yash-h9e]

1 - 2 dinnn bhiyea lag gya

[@harshityadav14354]

one day

[@simranarora2817]

you explanation is too good, and you are too humble. But I wish you could have made this in java

[@mohammadfraz]

Thank you. Visit my website leadcoding.in for Java Codes of my lectures.

[@sachinkhubchandani5703]

Can we handle the maximum recursion depth using this technique? I got a question where I had to run the recursive function around 50K times

[@RahulSharma-ip3pc]

1 hour m ho gya 8th lecture tk

[@sagestudy]

This is very complicated...

[@RAHUDAS]

What is Diff between Set and hashset.

[@bharathkumar5870]

#roadto25k

[@mohammadfraz]

❤️

[@vinitranjan2665]

class MyHashSet { public: int n=10e6+1; vector v; v.resize(n); MyHashSet() { } void add(int key) { v[key]=1; } void remove(int key) { v[key]=0; } bool contains(int key) { return v[key]; } }; Bhaiya v.resize(n) agr upr likh rhe to to error kyu de rha hi?

[@MayankSharma-vi1ok]

Uper likhne ka matlab h ki tumne abhi vector initialize nhi kiya h aur resize ka function use kar rahe ho so Error aayega.

[@akshyagarg2398]

Instead of using linked list we can take binary search tree which will make logn time

[@mohammadfraz]

No , that's not hashset Hashset works on O(1)

[@akshyagarg2398]

@@mohammadfraz but searching time will reduce na? the find function you used take o(n) time

[@mohammadfraz]

@@akshyagarg2398 no bro , it takes O(1) if we use a good hash function

[@akshyagarg2398]

bhaiya waiting for your reply and if possible can you please paste the code here ?

[@akshyagarg2398]

@@mohammadfraz okay okay I got your point. Hash function will distribute the numbers tsuch that finding them would be easier. Thanks bhaiya

[@nitansshujain811]

Sir, please update your description. You are no longer working at Curefit :)

[@aggarwalsachin4854]

second day and this episode

[@SunnyGupta00]

Reach++

[@syednadiya69]

Reached

[@manishkumarmahato2481]

Unordered set

[@gautamkhatri7895]

[@gokulbhaveshjoshi]

it took approx 1.5 hour to each ep8

[@50_kamalnarayanchaubey37]

within 5 hours, along with 1.5 hrs break in between

[@kartikeysingh8480]

0:15 Mujhe 2 ghante lage bhaiya ep.8 me aane me

[@atharvakulkarni2024]

time complexity??????????????of all the operations?

[@desihiphop4998]

bhaiya java ki linked list mein contains ka already ek pre defined method hai use use kr skte hain ??? class MyHashSet { LinkedList[] set; public MyHashSet() { set = new LinkedList[11]; } public int func(int key) { return key%11; } public void add(int key) { int i = func(key); if(set[i]==null) { set[i]= new LinkedList(); set[i].add(key); } else if(!set[i].contains(key)) set[i].add(key); } public void remove(int key) { int i = func(key); if(set[i]!=null && set[i].contains(key)) set[i].remove((Object)key); } public boolean contains(int key) { int i = func(key); if(set[i]!=null && set[i].contains(key)) return true; return false; } }

[@shivam4you744]

2nd day : )

[@gengar_13]

search wala jo function h wo waise list :: iterator search (int key ) kyu banana para why not int search ? plz samjha do

[@mohammadfraz]

Vo Iterator return karraha hai islie. List :: Iterator is the return type of search function

[@SunnyGupta00]

It took me 2hrs

[@mohammadfraz]

Keep moving

[@myyoutubeisthis]

To reach 8th episode mujhe 2-3 din lage.

[@deepakkumarverma6282]

Bhaiya what if the input is a negative number?

[@samartheory]

damn this guy knows his stuff!

[@saadhya98]

2days because I was busy in work

[@ananya8740]

but what if jo keys add krni hai unka modulo maximum time koi bhi ek particular number hi aa rha lets say hame 1, 11 ,21,31............... keys mil rhi h and hmne size 10 lia hua hai then hmesha kisi bhi key ko access krne ke lie O(n) time lgega na ?? i am very confused with the time complexity . please help me there

[@mohammadfraz]

Yaha pe hamara hash function kaam aata hai , hash function agar accha ho to ye jo aapne mention kiya hai , esa kabhi nahi hoga. Evenly spread honge numbers.

[@ananya8740]

@@mohammadfraz okay thankyou sir and just one more thing , can you please add time complexity at last because that is bit confusing in some cases

[@adarshsharadpandey4763]

Approx 1.5 hour to reach here...

[@rajkuhar3234]

reached in 1 hour at 1.5

[@asjadahmad1360]

it took me 2 hours

[@RajPatel-ev5vz]

bro,i tried to submit this question with same code but it keep showing some errors in leetcode, eg. when I use size = 100/1000 it shows deadsignal error and for size =10000 it shows runtime error,can you explain why? It runs correctly for size=1e6+1.

[@sunilkumar-ft3nk]

why 1e6 does not work ? and why 1e6+1 work?? can you please answer this

[@ronaldpatrick5108]

@@sunilkumar-ft3nk Because 1e6 only covers 0 to 1e6 - 1, We need 1e6 too