Wonderful explanation Ram! it was a so quick that I had pause and replay to understand the explanation. Ram is much faster than any data structure I should say. Thanks for sharing!!! Could you pls share what kind of Data Structure question i can expect for QAE II Role?
Hello Mahalakshmi, thanks for the feedback. I will make sure my videos are slow and easy to follow. Coming to your question, there is no single data structure targeted with QAE role. It can be any data structure. Practicing questions on leetcode or geeksforgeeks will help you to solve such problems in the interview.
11:55 i think hash table would be better here. it didn't specify if data is numerical, and hash tables have O(1) insertion, retrieval, and search on numeric and non-numeric data. Dont understand why you went with a binary tree. An example of an instance where you'd use a tree over a hash table is if there would be range queries which hash tables cant do, and that's not what this question is asking.
Hello, there isn’t a book which suggests which data structure to solve a problem, because there never is a single method of solving a problem. However choosing a optimal data structure by problem is something you will need, and unfortunately that comes only with practice. You can get a sense of what data structures to use for a particular type of problem with “Cracking the coding Interview book”. But ultimately practice helps you to recognize such things. Do leetcode everyday and you will get good at it.
I think Binary tree root node value can be equal or less than the right node value . I think you mentioned root node value should be is less than right node!
Dude, I wish I found this last semester. It’s super helpful
Thanks a lot for this wonderful video! Please make more videos with examples too.👍😊
Hello Lekshmi, I really want to do more videos. But I’m a new father and I’m being busy with personal stuff. Hope I could start videos pretty soon. 🤞
Wonderful explanation Ram! it was a so quick that I had pause and replay to understand the explanation. Ram is much faster than any data structure I should say. Thanks for sharing!!!
Could you pls share what kind of Data Structure question i can expect for QAE II Role?
Hello Mahalakshmi, thanks for the feedback. I will make sure my videos are slow and easy to follow.
Coming to your question, there is no single data structure targeted with QAE role. It can be any data structure. Practicing questions on leetcode or geeksforgeeks will help you to solve such problems in the interview.
I'm addicted to your videos.
Thank you Fahad!
11:55 i think hash table would be better here. it didn't specify if data is numerical, and hash tables have O(1) insertion, retrieval, and search on numeric and non-numeric data. Dont understand why you went with a binary tree. An example of an instance where you'd use a tree over a hash table is if there would be range queries which hash tables cant do, and that's not what this question is asking.
Thanks
Abhi bhi questions ko samajh nhi aata kaun se type ka data structures use karna h
one suggestion is use some white board . Awesome overview
Hey Sankar, thanks for the feedback. I tried whiteboard at one point. But there were some lighting issues. So had to change it to this way.
can u recommend the book for the right data structure to solve the problems pls?
Hello, there isn’t a book which suggests which data structure to solve a problem, because there never is a single method of solving a problem. However choosing a optimal data structure by problem is something you will need, and unfortunately that comes only with practice. You can get a sense of what data structures to use for a particular type of problem with “Cracking the coding Interview book”. But ultimately practice helps you to recognize such things. Do leetcode everyday and you will get good at it.
very nice
I think Binary tree root node value can be equal or less than the right node value . I think you mentioned root node value should be is less than right node!
Sir is point ko leke thoda aur explore kijiye request h