8.3 Double Hashing | Collision Resolution Technique | Data Structures and algorithms

[@Understanding_the_world_withme]

Respected ma'am the work you are doing for us is really priceless. You are one of my favorite teacher. I have lots of love and respect towards you. Thank you ma'am for teaching me and guiding me. 😊❤️

[@shreechatane9215]

improving your thumbnails may spread your videos even more !

[@SagarSingh-hd7pm]

Ohh shut up you idiot

[@deepakborah8335]

You have explained double hashing technique in depth.One of the best effort.

[@songoeregoba3009]

Your video helped me learn double hashing. Thank you. I should add that I was quite amused when you started to solve for keys 13 and 7, ran out of probes, and could not find a position for it given the limitations of m-1. Thanks, Jenny.

[@NERELLAADITHYABCE]

Ma'am, taken a great example, which shows different ways for failed insertions hats off ma'am!!!

[@KanonetTI]

It is a good example of how to choose better and more random has functions.

[@fathimakousar4603]

Mam...aap ki vajah se main apni online classes k vakhth ache se so parahihu...aur free time me apke videos se topics cover karleti hu ....shukriya .nd god bless u

[@neelesh621]

Nailed it....was founding everywhere till i stopped here. Awesome explanation👏👏

[@geetanjalijangid876]

U r genius mam Hopefully I wish and want u teach me in my front or real life ... That's a awesome time for me

[@Financewithashar]

25:38 We can tell the total number of probes as i value ranges from 0 to 9 hence each non inserted element will have probe value 10

[@vipulkesari4529]

your lectures are awesome keep making these kind of lectures Ma'am.

[@rajiyuva1280]

I want become a teacher like u mam.. tat much inspiring.. u r my role model.. thank you.. and also i am ur fan..

[@suresrada]

Amazing mam..you helped me a lot without money..you are in my one of the favourite teacher in my life..love you mam..clever

[@piklumalakar7552]

excellent mam...aaapka videos dekke bahut confusion dooor ho jata...thnk u. sooo much mam for ur valueable videos..

[@sobhityadav5753]

Best teacher I have ever seen....I am from babasaheb bhimrao ambedkar university lucknow

[@HariHaran-yq1hr]

Such A nyz..... Clear and Focused Lecture Lady! Thanks a Lot ✌🏻

[@vaibhavchawla2439]

Mam you are amazing . i faced two problems yesterday and you were there to solve those problems. So i wrote a program for double hashing and i was not able to store one string in that. And you made it clear to me . Thanks.🙌

[@ArunKumar-zp8cp]

Mam, your teaching method is really very excellent💯

[@monikasharma1184]

love you mam..😃 one of the best teacher 🙏

[@swamypediredla]

Love you Monika sharma

[@nannubedi7773]

At 13:34 when ma'am was gonna say 13 x 2 = Chabbis (26), I totally felt her !

[@obantikaroy9645]

You are amazing 💗your videos are really very helpful.i watch your lectures on a regular basis. Take love from Bangladesh.

[@_atom_gaming_]

Thank You so much Ma'am. I have completed DSA from here. Thanks

[@MonikaJ-gl5bk]

Just in one example mam had explained the depth of double hashing technique

[@mujtabaalisaif7788]

thanks alot mam ..this is surely one of the best DSA learning Channnel ...thanks for your existence on youtube

[@animeflicks5532]

Best Lecture For DS

[@mishsush49]

Simply great.. very nice explanation .. One of the best teacher I hv seen so far

[@pawanbhatta8973]

very well explained, thank you didi.. lots of love

[@heathbar8015]

Thank you so much for this explanation... Very clear and thorough! :)

[@yashgarg3373]

Ma'am you really are a good teacher.. Please make the video about the best technique to use that you said to make in this video

[@jatingupta4026]

you are the best mam. but please increase the quality of the video mam

[@fatimabhatti271]

Best channel.. Thank You ❤

[@RamineniBargawRaamcharan-dy6mr]

your expression was cute 😍3:28

[@_PAYALGAIKWAD]

thnx a lot mam..The work you are doing for us is helping us a lot.Your videos are very systematically arrranged and explaind 😇😇😇😇😇😇

[@shad491]

would you please create a course for c#? i think you are the only person who i can learn it from

[@CarlaLud]

Very clearly explained, thank you! At 16:26 you mention that you will talk about properties of a good hash function in the next video. Was this video made and if yes can you please share a link to that video? I looked for a video called 8.4 Hashing hoping that would be it, but cannot find a video under that name

[@kirtikhohal3313]

Ig she hasn't made that video.

[@mixed6891]

Plz upload rehashing also ...i like your voice ....know i want to learn that from u ...plz😭😭

[@subodhkulkarni-5448]

Very Good Explanation 👍

[@abhirajgupta2110]

This lecture is very helpful for me

[@ajayrebaloffical4373]

Everyone like plss... 🙏💖🥰 for this wonderful explanation

[@rishabhteli2339]

Nice Example

[@kpeducation3746]

mashallah ki samjhaya hai apbe very nice allah khosh rakhe apko

[@heenayadav2406]

Very well explained

[@VincentDania]

Thank you Jenny for this amazing lecture. Please I have two questions: 1. How did you get 10 as the value of m? 2. Why does 7 have a v value and 13 does not? Thanks, in anticipation of your response.

[@yka2992]

i start from 0 and end up at 9. if you count the index from 0-9 are 10=m. So m is the number of locations in the hash table.

[@cristinjhon8444]

Great....I don't know the words to express your skills,keep moving on...

[@sanyamjaincs1]

18:26 to 22:33 u r so hard working mam. must be the brightest student of your time :p

[@aazaa7334]

Found her on quora, she was the gold medalist.

[@DeviL-yw6ud]

Wow

[@harshpanwar1550]

Thanks a ton Ma'am🙇‍♂️🙇‍♂️🙇‍♂️

[@Randomtiger007]

I appreciate your videos very much...thank you very much

[@prakhargarg4166]

We use hashing to reduce search and insert time compkexity. You explained well how to reduce insertion time complexity, but how to search elements, you didn't tell, which was the main motto of this hashing concept. And also, why we are using quadratic probing, and double hashing, when linear probing is performing better than the latter two

[@muthierry1]

you're an amazing teacher , keep up ..

[@mvineela1345]

thank you !! Waiting for the properties of best hash function selection video.(continuation of this double hashing)

[@adityag6022]

Amazing video ma'am. Thank you

[@SG-kn2jl]

So what about 13 and 7...we just leave those keys or some other process is involved? 25:43

[@jahangiralamlaskar9626]

Your video was very much helpful....thanks for uploading your video

[@vakhariyajay2224]

Thank you very much. You are a genius.

[@bhargavasaikuntavloggs1632]

Good explanation

[@AryanGairola-th3qc]

Best.asalways

[@priyanshuroodki8679]

ma'am, your teaching skills are FAB:-)

[@dornalameghana1972]

Great explanation mam👏

[@tamoorahmad5070]

Jenny you better than my teacher...

[@keshavchaturvedi4015]

Your teacher wants to know your location 😂

[@namesignaturewitharooj3481]

V.v.v clearly explain ❤️❤️❤️❤️❤️❤️😍😍😍😍😍

[@jaisuriyar5259]

Please make a video on rehashing

[@nandanasharan6339]

Mam why are we using division method everywhere I mean in all the resolving technique questions? What if a question comes without mentioning this? will the answer be same? I love your videos and I have cleared many of my doubts with the help of these videos. Thank you so much Mam

[@boyacharansai3579]

Madam can we have about dynamic hashing. And also I loved your teaching skills mam. And I am from Andhra Pradesh.

[@mpalanipsbb]

Great work!!

[@shahadalkandari5848]

thank u tooooooo much it was easy discerption

[@shad491]

so helpful you are the best thanks

[@chaturbhujgaire]

got the A-Z same question which i'm searching

[@VishalKumar-ux8yy]

How can the probe for key = 11 be 3? - First, we calculated u, which is 5, now we don't know whether 5 has some key or not, we will have to check it by iterating over the table. Hence, probe = 1 - Now, we found that hash[5] = 6, thus collision, therefore, calculating v, which is 4. Now calculating location using (5+4*0) % 10 = 5, now we will again check in the hash table is hash[5] == None, but again collision. Hence, probe += 1. - Now, i = 1, (5 + 4*1)%10 = 9, hash[9] != None, hence collision, but probe += 1. - Now, i = 2, (5 + 4*2)%10 = 3, probe += 1. - i = 3, probe += 1 - i =4, probe += 1, and we store the value at 3. Thus final probe should be 6. I am confused here. Please help me out.

[@achalhingrajiya5168]

please make a video on the properties of the good hash functions you have mentioned at 16:25

[@NoName-l1w7o]

4 saal baad bnega ab

[@Lobster.Gaming]

Thank you 😊

[@codingexception6502]

Ma'am I guess for 11 there should be PROBES=4 As we are using first h1(k) and due to collision we are going for h2(k) due to which we get PROBES=3 . Are we supposed to not consider the PROBE of h1(k) ? Please correct me if I'm wrong.

[@RanDumbChicken]

Ma'am i think the way you got confused yourself while teaching this topic i think u should learn it first nicely your true fan Mohit

[@rickk3300]

Thank you ma'am🙏

[@emperorsreign2150]

Thank you mam

[@rishab3096]

You are the best mam 😘😘

[@tuliprubina9956]

super explaine thank u so much mam

[@anirudhdevpura2798]

You're videos are great ma'am. I just want you to explain code for hashing, heap etc in the upcoming videos

[@ziyaabbas6437]

one of the best thanks

[@khuramkhalid5396]

Thank you jenny!!!!!!!

[@saritakumari-oh8fs]

Super^100 Skill.

[@btsindianarmygirl995]

When we get easily place to 12 I feel like god is there .if it like more probing like 13 &7 definitely I will sleep by seeing ur video .

[@sambitbasu6261]

Ma'am I've noticed in your other closed hashing videos too, if we start the value of i from 1, then we can reduce one check. the colliding value will never be inserted in that case when i=0. Is my thought process correct?

[@sbc498]

yes

[@gourimmenon2726]

you do have a point..but here we are going by the definition to see its implementation..also if we count the no. of steps in this case we get the no. of probes too. Yes..just to know the location its not necessary to check i=0 case..you are right about that :)

[@ajaysrailzoneofficial]

Mam if Hash function is not give like 2k+1 then we need to simply use ki% mod m Formula na?? To find keys location 😀😀

[@aartibhilare3508]

Nice mam you are awsome 😍

[@ankitathakur5989]

Thanku so much mam ji

[@rehanmondal4529]

Excellecnt explaination..bt maam u skiped the topic cluster of blocks

[@mamun9728]

Life saver❤️❤️

[@animals5280]

Can you please upload multiplication method and universal method for hashing?

[@arjunwagh1298]

Very good explain

[@akuakana7364]

Thank you for the lesson 🙏🏽🙏🏽

[@AmitKumar-xr6cy]

great work

[@NERELLAADITHYABCE]

Ma'am expecting video on clustering plzz!!??

[@RahulSingh-fe6wy]

Very helpful!! thanks a lot mam:

[@jay-rathod-01]

@13:04 maybe the probes are 4 if we count the search or u as well and not just the finction of v.

[@kamyagupta4030]

Thank you so much!!

[@hirasuleman4946]

Great job:)

[@Rameshkumar-qt4ue]

very helpful

[@chitram5415]

very nice jenny

[@ahanadas7982]

Very helpful ❤️

[@Nirala_414]

In 1st lecture of hashing you have said us , the time complexity is O(1) how this is ?

[@sravanimotapothula7796]

Beauty with Brain😘