← All topics
Linked List Quiz: questions with answers
8 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. What is the time to access the k-th node of a singly linked list?
- Q2. When reversing a linked list, why do we save cur.next before changing cur.next = prev?
- Q3. The list is 1 → 2 → 3 → 4 → 5. Which node does the fast & slow pointer method return as the middle?
- Q4. Floyd's cycle detection uses…
- Q5. What is the main benefit of a dummy (sentinel) node?
- Q6. To remove the N-th node from the end in one pass, you…
- Q7. What are the time and extra space of iterative linked-list reversal?
- Q8. Which steps solve "Palindrome Linked List" in O(1) extra space? (select all that apply)