Less than 10 submissions
This set of questions and answers covers a wide range of JavaScript data structures, including arrays, linked lists, stacks, queues, trees, graphs, hash tables, heaps, bloom filters, skip lists, B-trees, suffix trees, and suffix arrays.
Practice these questions and get feedbacks! It will help you improve your answer.
Ads section
1. What is the difference between a skip list and a linked list?
2. What is the difference between a suffix tree and a suffix array?
3. What is the difference between a stack and a queue?
4. What is the difference between an array and a linked list?
5. What is the time complexity of adding an element to a hash table?
6. What is the time complexity of deleting an element from a binary search tree?
7. What is the time complexity of inserting an element into a B-tree?
8. What is the time complexity of searching for an element in a binary search tree?
9. What is the time complexity of inserting an element into a heap?
10. What is the time complexity of deleting an element from a skip list?
11. What is the time complexity of traversing a binary tree?
12. What is the difference between a graph and a tree?
13. What is the time complexity of inserting an element into a Bloom filter?
14. What is the difference between a B-tree and a B+ tree?
15. What is the time complexity of searching for a pattern in a string using a suffix tree?
16. What is the difference between a linear probing hash table and a quadratic probing hash table?
17. What is the time complexity of finding the minimum element in a heap?
18. What is the difference between a radix tree and a trie?
19. What is the difference between a red-black tree and an AVL tree?