Data Structure Theoretical Interview Questions
Updated 2018 version!!
This book contains tricky and nasty Data Structure theoretical interview questions that an interviewer asks. It is a compilation of advanced Data Structure interview questions after attending dozens of technical interviews in top-notch companies like- Oracle, Google, Ebay, Amazon etc. Each question is accompanied with an answer because you want to save your time while preparing for an interview. The difficulty rating on these Questions varies from a Junior level programmer to Architect level.
How will this book help me?
By reading this book, you do not have to spend time searching the Internet for Data Structure Theoretical interview questions.
Are there answers in this book?
Yes, each question is followed by an answer in this book. It will save your time during interview preparation.
What is the best way of reading this book?
You have to first do a slow reading of all the questions in this book. Once you go through them in the first pass, mark the questions that you could not answer by yourself. Then, in second pass go through only the difficult questions. After going through this book 2-3 times, you will be well prepared to face a technical interview for Software Engineer position in Data Structure.
What is the level of questions in this book?
This book contains questions that are good for a Associate Software engineer to a Principal Software engineer. The difficulty level of question varies in the book from a Fresher to an Experienced professional.
What are the sample questions in this book?
- Why do we need to perform algorithm analysis in programming?
- What are the main criteria of algorithm analysis?
- What is Asymptotic analysis of an algorithm?
- What are the Asymptotic notations for algorithm analysis?
- What is a Linear data structure?
- What are popular operations that we can perform on a data structure?
- What are the popular approaches to develop an algorithm?
- What are the examples of Greedy approach algorithms?
- What are the examples of Divide and conquer algorithms?
- What are the examples of Dynamic programming algorithms?
- What do you know about Linked list data structure?
- What are the main steps in development of an algorithm?
- What is a Stack data structure?
- What is the main usecase for using Stack?
- What are the main operations of a Stack data strcuture?
- What is a Queue data structure?
- What is the main usecase of using Queues?
- What are the main operations of a Queue?
- What is a Linear search?
- What is a Binary search?
- How does Bubble sort internally work?
- How does Insertion sort internally work?
- How does Selection sort internally work?
- What is the difference between Insertion sort and Selection sort algorithms?
- How does Shell sort internally work?
- What is a stable sort?
- What is a Graph data structure?
- What are the main operations in Graph data structure?
- What is a Fibonacci series?
- What is a Tree data structure?
- What are the different kinds of Tree traversal mechanisms?
- What is an AVL Tree data structure?
- How does Prim's algorithm to find minimum spanning tree work?
- How does Depth First Search work?
- How does Breadth First Search work?
- What is a Spanning tree data structure?
- How many Spanning trees are in Graph?
- What is Recursion?
- What is a Hash function?
- What is a Trie data structure?
- What are the pros and cons of using Trie data structure over a Tree or Hash Table?
- What is a Red Black tree?
