Questions
3 of 16
1What is a Sentinel Node/Dummy Node? Why is it useful?
2Why is insertion/deletion at the head of a Linked List O(1)?
3Why is accessing an element in a Linked List O(n)?
4How do you reverse a Linked List? (Iterative and Recursive)
5How do you copy a Linked List with random pointers? (Deep Copy)
6When would you choose a Linked List over an Array?
7What are the types of Linked Lists? (Singly, Doubly, Circular)
8What is an XOR Linked List? Why is it rarely used?
9What is a Skip List? How does it improve search time?
10Explain the difference between a Linked List and an Unrolled Linked List.
11Why does the standard library (Java/C#) not heavily feature Linked Lists? (Cache locality issues)
12How do you find the middle of a Linked List in one pass?
13What is a Linked List? How does it differ from an Array?
14How do you detect a cycle in a Linked List? (Floyd's Tortoise and Hare)
15Explain why QuickSort is preferred over MergeSort for Arrays, but MergeSort is preferred for Linked Lists.
16How do you merge two sorted Linked Lists?
