Less than 10 submissions
This is a collection of Java data structures questions commonly asked in interviews.
Practice these questions and get feedbacks! It will help you improve your answer.
Ads section
1. What is the time complexity of searching for an element in a hash table?
2. What is the difference between a stack and a queue?
3. What is the time complexity of adding an element to the beginning of a linked list?
4. What is the difference between a binary search tree and a red-black tree?
5. What is the difference between a graph and a tree?
6. What is the difference between an array and an ArrayList?
7. What is the time complexity of finding the minimum element in a heap?
8. What is the time complexity of traversing a graph using depth-first search?
9. What is the time complexity of finding the shortest path between two vertices in a graph using Dijkstra's algorithm?
10. What is the difference between a directed graph and an undirected graph?