What is unordered_set and it's implementation in c++ | Hashing data structure | Hello World
Vložit
- čas přidán 15. 03. 2021
- This is the video under the series of DATA STRUCTURE & ALGORITHM in a HASHING Playlist. We are going to learn What is unordered_set in Hashing and How we can implement unordered_set in c++.
We also Provide courses on Competitive Programming and Data structure. Please see our Full Playlist on our Channel.
We also Provide courses on Competitive Programming and Data structure and Algorithms. Please see our Full Playlist on our Channel.
----------------------------------------------------------------------------------------
Pdf of This Video: github.com/Prince-1501/Hello_...
code in This Video: github.com/Prince-1501/Hello_...
----------------------------------------------------------------------------------------
*Follow me *
LinkedIn► / iamprince
Facebook► / helloworldofficials
Instagram► / helloworldbyprince
Twitter► / prince_king_
----------------------------------------------------------------------------------------
►Our Playlists on:-
►Competitive Programming: • How to start Competiti...
►C++ Full Course : • L-01 || Introduction a...
►Algorithms: • L-01 || Prefix Sum Arr...
►Data Structure: • Data Structures with C...
------------------------------------------------------------------------
#hashing #geeksforgeeks #programming
sir, your videos are so good, they clear every concept.
the way u explain the find() function is very clear to me now.
Thanks yaar
That's what I am trying to teach
And you got it my point
absolute lies! I can't even understand what he's saying! He needs to work on his english. ;)
one who knows to make, others understand. Well done
Samajhte to aap badiya hi ho isme koi doubt nahi hai 🔥
Thanks 🥰
Sir to koi bhi bn jayega lekin bhaiya bn ke dikhao to maano isliye thank you bhaiya....... Bhaiya bol ke pdhne se feeling jud jaati hai teacher ke saath❤❤❤
Love your thoughts here 💕
printf("thanks... very helpful!");
Great video bro!! Very helpful
Take live classes and share some dunes also😀
Thank you bro
I like your hash data structure series
Very well explained Superb!!! Concept is easy now. Please mention where all it is used?
Awesome Explanation,Thank you bhaiya 😊
Thanks Saurabh
please take live class
Yeah I am thinking too
thanks for your hard work for us.
It's my pleasure
thnk u so much
Thankyou bhaiya
Thanks a lot for video
Most welcome
Really thankyou bhaiya for explaining three find function Really well
For this really thankyou bhaiya
All the best
Thanks a lot !
🎯 be consistent
Thank you bhaiya...... 💯
Bass aise hi consistent raho aap
Nice Video
Bohot sahi!
Thanks Prashant
Great job!
Thanks Abhay
0:51 exactly 🔥
very helpful playlist
Glad you think so!
Awesome lecture Bhai jaan 🥰
That's really wonderful 😍
Thanks for liking
Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀
@@HelloWorldbyprince yeah! Of course ☺️
thanks nice vid!!
keep learning yaar
Please, if possible then share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀
Respect!!! 🖤
Thanks ☺️
👍
great vid!
thanks a lot
Those who don't understand find function, its like looking for someone you know in a queue. If you know someone then you will stop and talk to them otherwise keep on moving until the end of the line. If you are interrupted then the person you know is found otherwise that person isn't found. Now swap the queue with array's index and person with key.
Helpful brother
great video
Thanks for the support
now its nice
thank you vaiya.
welcome buddy
thank u
You're welcome!
Take live classes with 80% only problem solving I would love that
I would also love that 🥰
The problem with those stupid live classes is that it takes a lot of time to watch. We want the topics to be taught in maximum of 20 mins.
I can understand satvik
great
Thanks
At last there should be 2 statements:-
Key found
Key found
But it only printed once there is some error
Can u please clarify?
If u r thinking its not right
Then do once a Dry run in your copy without seeing my solution
For same question
And whatever u get ..u r right then
Yaa exactly........ please live classes
Yeah sure ☺️
Bhai live class
Yeah sure ☺️
you explained find function like it is traversing in the set
so then how it is O(1)
it isnt traversing, probably what is does is create a key for the element and then look for that key in direct-access-map and return the position of it in the map
6/18 done (7.12.22)
How find and end functions work in if condition without loop??
any topic on you make thumbnails make part wise so we can find easily
and you make videos on dsa problems.
Means u want numbers 🔢 on thumbnail ?
@@HelloWorldbyprince also my name is Prince khunt yes bro like you codewithharrys chhenal on you seen and keep it on making video and earn 100k winner play button 😊😊😊 thank you to giving reply which company in you do working. I am a 16 years old and I completed c c++ and some algorithms and ds and core java so what I do next if you have any idea so you do me reply
Nice work bro.. Thankx
Welcome
keep learning buddy and be consistent and share my channel with your college groups that helps me a lot
bhaiya isme hmne hashing kha use kiya hai......implementation to hua hi ni bs kaam kese krta hai ye bataya gya hai
for (auto it = S.begin(); it != S.end(); it++)
{
cout
Yes there are many ways and it is one of them
Let's say 2nd one is
For ( auto x : S )
{
Cout
what exactly is umap.find(key).it seems to be of the same type as iterator itr. but why can't we print it if it's a memory location(like a normal pointer)?
yess u got it right ... but its a kind of iterator
Let the size of set be n. If we write the find function for finding any key will the compiler iterate through all the elements of the set in this case will the time complexity be O(n)?
27 sep placed
Yes
no
Been more than 1 year working
Please do cover the whole STL topic with some examples too.
There is complete playlist on STL: Standard Template Library (STL) By Hello World: czcams.com/play/PLzjZaW71kMwR-oGkXfxfz4dmVe2dkNh0K.html
complete
good
Sir what is means s.find() == s.end()
sir aap bihar se hai???/
which song is this 16:47 ?
Last main count kraa bhaiya...
Fir find nd count main kya difference hai fir kyunki dono ka toh output same hi tarah kaa aa rha h
find iterator(pointer) return karta hain and count 1 aur 0 1 if element present 0 if element absent
0:45 Bhaiya ye background music kon sa ha??
Bhai or bhi daloge kya hashing ki video
not yet
bhaiya very nicely explained
17 minutes worth spending tbh
Thanks God 😍
GOD 🙏
Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀
My god, that accent kills me, I havent understood its English firstly
Bhaiya what is the difference between hashing using 'map' and hashing using 'set'? Please reply
Please see my full playlist on hashing
Aapko fir kabhi v koi v doubt nahi aayega
Hashing Data Structure | Complete guide For Interviews DSA | HELLO WORLD | Prince: czcams.com/play/PLzjZaW71kMwQ-D3oxCEDHAvYu8VC1XOsS.html
10 baar bol liya bhai achii chiz hai achhi chiz hai...thik hai bhai achii chiz hai toh padha le ...baar baar bolnese kya hoga
🤨
great video
Glad you enjoyed it
keep learning buddy and be consistent and share my channel with your college groups that helps me a lot
great
Thanks a ton
Please, if possible then share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀
Really loved your content, will see the entire playlist, and will definitely share this.