Hey, the audio for this video is not equal on both earphones its more toward the right...please make it better. The concepts are very simply explained I like that.
I think it would be better to write A[h(key)] instead of A[key] in sample code because array index is not the key itself here but the hash value of it (as you also stated in the video).
do you think your search(key,element) is correct? it may be correct for checking if it that key value is present in hashmap . but what if we want to get a value from a key which has lots of value in hashtable because of collision.here how will it know that which value is my key value?
BEST hash intro video series
Nice voice, great job... Thank u
Thank you Ma'am , You Are a Great Teacher 😍📚
God bless you ,Dear . Thanks😍😍
Hey !!
While inserting, you won't be Adding it to A[key] but rather at A[hash(key)] and same for Searching also. :)
Tq u for the information...... Nice handwriting..
Thanks a lot mom, you are the best
Well done. Its perfect 😍
Hey, the audio for this video is not equal on both earphones its more toward the right...please make it better. The concepts are very simply explained I like that.
This Voice is just to cute. Well explaind!
I think it would be better to write A[h(key)] instead of A[key] in sample code because array index is not the key itself here but the hash value of it (as you also stated in the video).
+
She said it on 1:20
mam why don't you upload new videos .your videos are far more better then university professors!
@lalitha you Really saved my day.. I could've given you 1B likes
Thank you so much
you are AMAZING ,thank you
Do we need the element parameter when searching? I thought we search only by key.
thanks
do you think your search(key,element) is correct? it may be correct for checking if it that key value is present in hashmap . but what if we want to get a value from a key which has lots of value in hashtable because of collision.here how will it know that which value is my key value?
love your video :)
Love you❤❤❤ thanks