next
Round
Technologies
Coding Problems
Bookmarks
Learning Paths
next
Round
Technologies
Coding Problems
Bookmarks
Learning Paths
1
What is a Sentinel Node/Dummy Node? Why is it useful?
Beginner
2
Why is insertion/deletion at the head of a Linked List O(1)?
Beginner
3
Why is accessing an element in a Linked List O(n)?
Beginner
4
How do you reverse a Linked List? (Iterative and Recursive)
Beginner
5
How do you copy a Linked List with random pointers? (Deep Copy)
Advanced
6
When would you choose a Linked List over an Array?
Intermediate
7
What are the types of Linked Lists? (Singly, Doubly, Circular)
Beginner
8
What is an XOR Linked List? Why is it rarely used?
Intermediate
9
What is a Skip List? How does it improve search time?
Intermediate
10
Explain the difference between a Linked List and an Unrolled Linked List.
Intermediate
11
Why does the standard library (Java/C#) not heavily feature Linked Lists? (Cache locality issues)
Intermediate
12
How do you find the middle of a Linked List in one pass?
Beginner
13
What is a Linked List? How does it differ from an Array?
Beginner
14
How do you detect a cycle in a Linked List? (Floyd's Tortoise and Hare)
Beginner
15
Explain why QuickSort is preferred over MergeSort for Arrays, but MergeSort is preferred for Linked Lists.
Intermediate
16
How do you merge two sorted Linked Lists?
Beginner
All Topics
1
Foundations
0/2 topics · 0%
Basics
Complexity Analysis
2
Linear structures
0/4 topics · 0%
Arrays and Strings
Linked Lists
Stacks and Queues
Hash Tables
3
Non-Linear structures
0/2 topics · 0%
Trees
Graphs
Share
this topic
Share via WhatsApp, X, Facebook, LinkedIn or copy link. Open Graph preview enabled.