Best you tube channel on Data Structures. Beautiful handwriting, nice voice, perfect pace. step-by-step clear explanation. Did not miss a single scenario in the logic. Excellent work.
Best youtube channel so far i ever encountered for data structure. Love your simple explanations to all difficult problems that i faced in my studies♥️. Keep this up. Good wishes😊
I think we also need to take the marker in an index into account while writing the pseudocode for insertion, because it shouldn't skip such an index to insert an element.
I don't know why youtube keep showing me 100k+ views video with the hard methodology
*I Prefer smooth and simple videos like this. Thumbs Up* ☺
Best you tube channel on Data Structures. Beautiful handwriting, nice voice, perfect pace. step-by-step clear explanation. Did not miss a single scenario in the logic. Excellent work.
Best youtube channel so far i ever encountered for data structure. Love your simple explanations to all difficult problems that i faced in my studies♥️. Keep this up. Good wishes😊
I'm so in love with your voice🥺
(I am too 🥺)
Your videos have helped me clarify these concepts. Thank you so much.
Cheers from Germany.
Your voice is making us relax due to your are going to solve all the confusion ❤ thank you ma'am good bless you 😊
What a fantastic presentation! Thank you!
thank you for making such simple and easy understanding video for hash.
I LOVE THIS VIDEO!!!!! also beautiful hadwriting
Man I wish you were my professor! You explain it waaaay better than her!
Thank you for video. It made me understand hashing easily.
Excellent video!
this video survive my reporting thankyou so much and goodbless staysafe
mam why don't you upload new videos .your videos are far more better then university professors!
so wonderful, thank you.
I think we also need to take the marker in an index into account while writing the pseudocode for insertion, because it shouldn't skip such an index to insert an element.
thank you thank you thank you thank you
best explanation
nice explanation!
Nice One..!
Voice 💕💕
Great Explanations! Kudos. But how do we re add an element to a space where some element was deleted
So the time complexity of insert, delete and search for linear probling will be O(N)? It's a little slow.
Thanku for this vedio mam..my confusion is clear now.😀
Thanks you sis
thanks love you
Will u make a video for linear probing with replacement and without replacement?
OMG! my teacher took 2 hours and i dint not understand u told in 10 mins
Can anyone help me? What is a MARKER(K.A) in the end of this video? It's a boolean marker?
thankss
Great
You said the logic goes “circular” (one round), but the pseudocode doesn’t reflect that... :(
it literally does...think twice before commenting nonsense.
that mod does the job
Can u state advantages of linear probing with replacement over without replacement ?
What would the mod N mean is it the tablesize?
büyüksün kraliçe
katılıyorum
Iss main 33 kaya se aayea mam
بحبك
But how u find hash(vales) in your video....?
with hash function you dumb fuck