Hashing | Set 1 (Introduction) | GeeksforGeeks

[@jovinMendes]

For those who didnt get why h(x) = 9864567654 mod 7 = 4 First you have to 9864567654 / 7 = 1409223950.57 14285. Then take the decimal and multiply it by 7, so 0.57 14285 x 7 = 4

[@akirubamiru6700]

Very precise, thank you. For the folks who are irritate by his quiet voice, I hear him perfectly in my headphone.

[@mayankbisht8638]

Great job buddy. At 3:03 i enjoyed that 10 ki power n

[@GeeksforGeeksVideos]

Thanks. :)

[@pandeyabhineet]

I thought I was the only one lovin it XD

[@soumabratabhattacharya3375]

same here

[@yuktikhantwal2342]

hahahahahahahahaah hell yeahhhhh

[@KomalMamHere]

Yes😂😂i also heard

[@GATEVeteran]

Watch at 1.5x Speed.

[@saurabhsharma-pf8wq]

*2.0X

[@Christian-mn8dh]

3x

[@iansullivan9738]

SPEAK LOUDER, BILLY! I CAN'T HEAR YOU!

[@shashank4577]

Haha atleast he's not someone who complains like you !!!

[@ron0studios]

@@shashank4577 hey its just some feedback man.

[@zhengcao6529]

@@shashank4577 Cannot hear you

[@brijmohansiyag9668]

tup tap rahne ka

[@neuron8186]

@@shashank4577 dumb

[@divyebhutani5102]

In the middle of all English. " 10 ki power N "

[@GeeksforGeeksVideos]

Haha. :)

[@AgneseDeturenne]

Thanks for the forecast! Just a quick off-topic question: My OKX wallet holds some USDT, and I have the seed phrase. (alarm fetch churn bridge exercise tape speak race clerk couch crater letter). How can I transfer them to Binance?

[@vitor1678]

He says at 6:38: "We'll cover both these methods in a separate video." But the use of 'both' to discuss three or more entities is grammatically incorrect.

[@AshokYadav-np5tn]

Please speak louder :)

[@sanjanaattanayake4231]

Great explanation. Thank you!!

[@mohamedrashad4855]

Great explaining buddy, Thanks too much.

[@mattkriese7170]

Great explanation. Thank you

[@jaypunekar590]

did that guy just say "ten ke power n" at 3:03?

[@debarunmukherjee9069]

please explain the m*10^n, how does the size of table becomes size of pointer times 10 raised to the power number of digits?

[@GeeksforGeeksVideos]

Let the number of digits in phone number be 'n' . Then the maximum value that can be stored using these 'n' digits is 10power(n). For example, for a 10 digit number, maximum number that can be stored is 9999999999, which is of the type, 10power(10). Now we need m pointers to store these, thus the complexity comes out to be as O(m* 10power(10)). Hope this solved your confusion. :)

[@debarunmukherjee9069]

GeeksforGeeks thank you.

[@morning5tarr]

@@GeeksforGeeksVideos thanks

[@chayandas4942]

liked that 10 ki power n at 3:03

[@chantata]

Thank you for great explaining!

[@ShyamSundar-zt9yu]

thanks for providing such kinds of gr8 videos .. plz make more videos wih more egs :)

[@GeeksforGeeksVideos]

You're welcome, Shyamsundar. We are actively working on adding more video tutorials on our channel. Stay tuned.

[@nparween58]

I select the normal speed to 1.25x then its feels like its normal speed 🤣🤣 though content is good very understandable 😊

[@travelogue4566]

great work , thannks for uploading video .plz make a video on dyanmic programing ,string ,array because this is very important .

[@GeeksforGeeksVideos]

Hi Chandan, We have made some videos on Dynamic Programming and Arrays. You can find them below: Dynamic Programming: kzbin.info/www/bejne/o57NdY19iNdqe6M Array: kzbin.info/www/bejne/rqXJm2djp8R0ntU We are working on adding more videos on other topics.

[@travelogue4566]

Hi GeeksforGeeks , add video on programming interview questions that's the more important .

[@GeeksforGeeksVideos]

We'll add those too, soon.

[@prasaddedhe9274]

I am greatfull!! Thanks

[@samsepiol3268]

How do you print clown?

[@tariqkhasawneh4536]

Could anyone explain the O(m*10^n) part please?

[@adityasher]

Didn't understand the proposed solution to the repeating value that hash function provides, you have claimed that it will take linear time to search the data, however, if we have multiple phone numbers under the same hash it will take more time, can u please explain, how will we deal with the overlap?

[@shashwatrathod1342]

searching the whole list would have the complexity O(n)..but by hashing we are atleast narrowing it down to some extent as we can get to hash value 1 in O(1) and then search for our number. I think that is the basic idea

[@zuherabud744]

why is it mod 7 in h(x) = x mod 7? why not 10 why not 5 or any other number thanks

[@EcUVn]

Just for example purpose...

[@awzsdrcfgybhjimklp]

"If you have any doubts" much better said as "if you are still confused about..." I don't doubt what you said in the video is true, because if it was then that would be another problem. This is what you really mean to say anyway.

[@nocturnal_wanderer]

Is it necessary to mod by 7 ?

[@vijaynerkar4437]

Hi, explanation is good. I have one query. Here O(m * 10n) , why 10 is used ?

[@RamKumar-kz8gg]

considering mobile number is of length 10

[@ucantcme-]

Bro it might be good If u speak a little louder

[@Chainless_Slave7]

U get a better headphone.

[@shubhamtyagi9283]

Please increase the quantity of voice

[@deekshithpranav1619]

playback speed atleasr x1.25 for better time management purpose. thank me later.

[@ashishmishra672]

Hi, can you please explain why are we taking mod 7 for indexing? Thanx.

[@md.mujtabaraza1919]

I think that, we can take any number for that. Our goal is to reduce the value of x...

[@iamyuvraj128]

Absolutely

[@skyvisionmessengers]

The video is not audible

[@dhrumilgohel1655]

Plzzz Speak enough louder that we can understand ..

[@woofelator]

Thank you so much, Illuminati :D I'm sorry for the conspiracy theories and tinfoil hats

[@saurabhgupta7785]

Is the playlist of 7 videos sufficient for the topic hashing in GATE

[@sensei249]

its just introduction ti hashinfg read books for deep knowledge

[@kaushalgosaliya9396]

Please give one example to more explain hashing

[@GeeksforGeeksVideos]

Hi Kaushal, We will be discussing examples in the next two videos on hashing. We are following the content present in the GeeksforGeeks articles. In the next two articles, we have discussed two Hashing techniques with an example - 'Separate Chaining' and 'Open Addressing'. quiz.geeksforgeeks.org/hashing-set-2-separate-chaining/ quiz.geeksforgeeks.org/hashing-set-3-open-addressing/

[@kaushalgosaliya9396]

Thanks

[@gauravdhiman5846]

Outta nowhere "10 ki power n" . lmao

[@AmirHosseinBagheri]

Please increase the volume! You're whispering!

[@timcook3410]

binary search takes an O (n logn) time, ri2gt?

[@GeeksforGeeksVideos]

Binary Search takes O(log n) because at every iteration the search space is becomes half of the previous step.

[@supriyapurohit1090]

Merge sort take O(nlogn)

[@AyushAgarwal-YearBTechElectron]

very low volume :(

[@Shayansubhan2320]

Where is the volume bro

[@jatinsharma6475]

Volume gya tel lene

[@udaykiran557]

Plaese explain at4:39 How can get mod 7 as 4 And mod 7 as 5

[@yashasvirallabandi9070]

I think mod is the remainder function.

[@ajaythakare2643]

Khana nhi khaya sir aaj avaj nhi arahi he

[@roshanbhattad4493]

what! there was audio tooo

[@ashishburman4314]

please do something of the audio..its too low

[@Chainless_Slave7]

U get a better headphones.

[@kyleserrecchia7234]

So quiet as to be unwatchable :(

[@subhrojeetsaha6828]

I suggest you guys use better equipment for making videos. the content is okay anyways

[@Chainless_Slave7]

U get a better headphone.

[@sauravkumar3278]

mummy ne mana kiya hai jyada tez bolne ke liye???

[@prashantranjan6487]

Sir thoda zor se bol diya kro, yeh asmr nhi hai xD

[@sat6011]

Sounds are not better

[@parthgoel6151]

bro not loud enoough

[@nienax97]

I almost sleep

[@bahultyagi]

Tej ni bola jara kya , bwasiir😂

[@ibnantonio]

why was this so damn loud

[@apoorvdixit2856]

tumhari site to badiya hai question bhi achhe hain par content ko badha ghatiya tarike se samjhaya hai, though i used your site to practise question but the explanation of various questions is rediculous, i was going through juggling algorithm on your site, i literaly slept reading that.

[@ambargharat625]

jaldi bol kal subha panvel nikalna hai xd

[@Thhion]

Kha kar nai aya tha subah

[@venkateshrm7707]

more louderrrrrrrrr

[@_Deepak__Verma]

I used two speaker to listen your voice cmmn man speak louder

[@alekseevaleksandr]

I hear nothing!

[@undisputed__9166]

10 ki power n 🤣🤣🤣🤣

[@mohammadiliyas2748]

Everything is awesome But have to make it more attractive

[@Cybersecurityanalyst1]

I am getting sleep bro

[@nirajgusain1452]

Why do you speak so loudly buddy.

[@whitechocolatemocha9171]

great video, terrible audio :/

[@Chainless_Slave7]

U get a better headphone.

[@whitechocolatemocha9171]

@@Chainless_Slave7 terrible attitude :D

[@Chainless_Slave7]

@@whitechocolatemocha9171 Dude I can hear him clearly 48000 kHZ, clear audio. Volume 100%. If one can hear dont blame the creator.

[@vishalpatil4983]

Bro sound is too low

[@Chainless_Slave7]

U get a better headphone. I hear him clearly dude.

[@randompersonontheinternet8981]

acha mic lele

[@Thhion]

Jor se bol na be

[@RajeshRanjan-es4nk]

10 ki power n lol

[@chinmayakumar4811]

Please be louder.

[@rajemon]

poor video., not good content