Hashing - Bloom Filter 

No one can explain as simple as this. Kudos to U. Keep up your work.

The explanation is crystal clear. Well done! SO easy to understand rather than reading this through the textbook. Thank you!

So far the best video on Bloom Filters. The explanation is very clear and precise. Thankyou.

You just made it crisp and simple.Thank you very much.

I hadn't known anything about Bloom Filter before watching this video. Now I understand basic concept. Well explained, thanks.

This is a really good explanation! Didn't find a proper example anywhere, just a bunch of theory without context. Thanks a ton.

Perfectly explained! Thanks a lot for this video.

Congratulations ! You explained in a simple and objective way what Bloom's filter is.

Clearly explained, thank you!

Found this nice explanation of why this is needed: A bloom filter doesn't store the elements themselves, this is the crucial point. You don't use a bloom filter to test if an element is present, you use it to test whether it's certainly not present, since it guarantees no false negatives. This lets you not do extra work for elements that don't exist in a set (such as disk IO to look them up).

well explained. Such simple and yet detailed explaination makes learning easy :)

Very well explained. Thank you!

Fantastic, you explained it very well, in quite a short time.

simple enough for me to understand. Thanks so much

very clear and concise. Thank you!

Very clean example. Keep up the good work!

Thank you for this video! It was very well made, you all are helping massively with my studies

this is exactly the video you should start with. Kudos to your teaching skills ! best wishes

prolly the best version of bloom filter explanation

Wonderfully explained. Thanks a lot.

Very well explained the concept of bloom filter. thank you

Thank you for your good explanation.

Awesome! Keep creating more quality contents like these! :)

Very good video, you helped me a lot. Thank you so much!

Very precise and understandable explanation🙌

thanks for giving example I have an exam in 30 minutes and I watched the video it is very helpful I could not understand the concept before but now I am clear.

Best guru, i've watched all of your hashing videos ♥️👍

I simply thank you a lot

Insanely good explanation.

Good handwriting! Also well explained, and a good format. Ideas for a part 2: 1) How to decide how many hash functions to use? 2) Best way to generate the hash functions? 3) Explanation of when this is better than a HashMap. Enjoyed the video, thank you.

Very good handwriting and solid explanation thank you

Great explanation.......understood it clearly

That's Explained well enough...

Really helpful and easily explained thank you and please add more videos of different algorithm like page rank,dgim,pcy and many more 👍

Brilliant . Thanks 😊!!

best explanation ever!

Good example! Thank you

Thank you for this videooo !

Wow excelent explination i became a fan, keep it up :)

Nicely explained. I think I TRUE POSITIVE is also one among the results.

Great Video !

Really helpful!

Thank you mam for such explanation😄😄😄

Very well explained thanks

Nice job. Keep it up !

very good video thank you !

Best Bloom Filter!!!

That “SURE” on 4:55 just killed me.

Very nice video!

explained really well

good explanation thank you....

Thanks for the video

Great explanation

Thanks a lot Madam...

Very well explained

Extremely well explained! Thank you very much for sharing it. Could you please me know how I could define my hash functions or doesn't matter? I mean. you use #func1 = x mod 5 and #func2 = (2x +3) mod 5. But could I change it?

Thank you

How do spilt the hash function h2 as (2x+3) mod 5

thank you

Great!

apart from the best explanation you really have an angelic voice too

thank you !!!

Thank u so much

Please continue great work you are doing, Excellent! DO not worry number of subscribers, it will be multi fold very soon

very good explain

thanku aunty

Thanks

Your explanation is cool... How can we be sure that probability of the false positive is less than other (not present scenario) any mathematical proof available ?

well said👏👏

Thanks for the amazing explanation! A few questions Does M - determine the length of a string? For the sake of understanding, if my M is equal to 6, does that mean I have 6 bits? How do I know how many filters I need as a minimum and how many I can put as a maximum Thanks!

Legend

How to come up with the hash function?

Soothing voice noice😊❤ nice explanation tho...!

God bless you

Very thanks sister 😭😭😭 it's helps me for exam

very good vid

awesome

Hi Maam, Can you share references you used for making this video? It will be helpful for me to explore more

mam why don't you upload new videos .your videos are far more better then university professors !

ur writing is oddly satisfying lol

Great

why don't you try graphs in data structures?

best

superb

mam how about a face reveal

Well explained with examples. (Instead of reading 10 papers just watch this video 8 minutes :) )

didi 20 minute mein paper hai mmd ka, bacha liya aapne

Nicely explained. Thank you so much.