1.
Name some pros and cons of Linked List compared to Arrays
Sign in to unlock
Get unlimited access to all questions and answers
Get lifetime access
Track progress
Save time
The fastest way to prepare
for a tech interview
Check our curated list of full-stack, data structures & software architecture interview questions and answers for developers
Web & Mobile dev Web & Mobile dev
Data structures & Algorithms Data structures
Software Architecture Design patterns
Linked Lists interview questions.
Only challenges
- 2.
Define a Linked List
Answer:
- 3.
What is a cycle/loop in the singly-linked list?
Answer:
- 4.
What is time complexity of Linked List operations?
Answer:
- 5.
What are some real-life use cases of Linked Lists?
Answer:
- 6.
How to implement Linked List Using Stack?
Answer:
- 7.
How to reverse a singly Linked List using only two pointers?
Answer:
- 8.
Detect if a List is Cyclic using Hash Table
Answer:
- 9.
Convert a Singly Linked List to Circular Linked List
Answer:
- 10.
Insert an item in a sorted Linked List maintaining order
Answer:
- 11.
Convert a Single Linked List to a Double Linked List
Answer:
- 12.
Compare Array based vs Linked List stack implementations
Answer:
- 13.
When is a circular linked list useful?
Answer:
- 14.
Floyd's Cycle Detect Algorithm: How to detect a Cycle (or Loop) in a Linked List?
Answer:
- 15.
Floyd's Cycle Detect Algorithm: Remove Cycle (Loop) from a Linked List
Answer:
- 16.
Floyd's Cycle Detect Algorithm: Explain how to find a starting node of a Cycle in a Linked List?
Answer:
- 17.
Merge two sorted singly Linked Lists without creating new nodes
Answer:
- 18.
How to find Nth element from the end of a singly Linked List?
Answer:
- 19.
Implement Double Linked List from Stack with min complexity
Answer:
- 20.
Convert a Binary Tree to a Doubly Linked List
Answer:
- 21.
Remove duplicates from an unsorted Linked List
Answer:
- 22.
Find similar elements from two Linked Lists and return the result as a Linked List
Answer:
- 23.
Split the Linked List into k consecutive linked list "parts"
Answer:
- 24.
Sum two numbers represented as Linked Lists
Answer:
- 25.
Why is Merge sort preferred over Quick sort for sorting Linked Lists?
Answer:
- 26.
How would you traverse a Linked List in O(n1/2)?
Answer:
- 27.
How to apply Binary Search O(log n) on a sorted Linked List?
Answer:
- 28.
How is it possible to do Binary Search on a Doubly-Linked List in O(n) time?
Answer:
- 29.
When is doubly linked list more efficient than singly linked list?
Answer:
- 30.
How to recursively reverse a Linked List?
Answer:
- 31.
Find Merge (Intersection) Point of Two Linked Lists
Answer:
- 32.
Given a singly Linked List, determine if it is a Palindrome
Answer:
- 33.
Find the length of a Linked List which contains Cycle (Loop)
Answer:
- 34.
Why would you ever do Binary Search on a Doubly-Linked list?
Answer:
- 35.
Do you know any better than Floyd's algorithm for cycle detection?
Answer:
- 36.
Copy a Linked List with Random (Arbitrary) Pointer using O(1) Space
Answer:
One tip that got me hired by Google, Microsoft, and Stripe
I've worked for Microsoft, Google, Stripe, and received offers from many other companies. One thing I learned when I was interviewing myself is that standard interview tips are woefully inadequate.
Reverse Tech Interview: Questions to Stump an Interviewer
Few people want to get into an uncomfortable environment or an unprofitable company with no prospects. If you’re wondering how to get a real feel for a company during an interview, you’re welcome. I’ll give a list of questions that interviewers don’t usually expect...
How to become a programmer, move to the US, and get a dream job
Are you curious about what you need to do to earn more than $15.000 a month, drive a Tesla, live in sunny California, and work at Google, Apple, Facebook, or Amazon?
11 Reactive Systems interview questions and answers for software engineers Reactive Systems
Reactive systems are an architectural style that allows multiple individual applications to blend into one unit, reacting to their environment, while staying aware of each other. Here is a list of coding interview questions on Reactive Systems to help you get ready for your next data struc...
Reactive Systems
34 Microservices interview questions and answers for software engineers Microservices
Microservice architecture – a variant of the service-oriented architecture structural style – arranges an application as a collection of loosely coupled services. In a microservices architecture, services are fine-grained and the protocols are lightweight. Here is a list of coding intervie...
Microservices
7 Layering & Middleware interview questions for developers Layering & Middleware
Middleware in the context of distributed applications is software that provides services beyond those provided by the operating system to enable the various components of a distributed system to communicate and manage data. Middleware supports and simplifies complex distributed application...
Layering & Middleware
55 Docker interview questions and answers for software engineers Docker
Docker is a set of platform as a service products that use OS-level virtualization to deliver software in packages called containers. Here is a list of coding interview questions on Docker to help you get ready for your next data structures interview in 2021.
Docker
23 Databases interview questions and answers for software engineers Databases
A database is an organized collection of data, generally stored and accessed electronically from a computer system. Where databases are more complex they are often developed using formal design and modeling techniques. Here is a list of coding interview questions on Databases to help you g...
Databases
21 Concurrency interview questions and answers for software engineers Concurrency
In computer science, concurrency is the ability of different parts or units of a program, algorithm, or problem to be executed out-of-order or in partial order, without affecting the final outcome. Here is a list of coding interview questions on Concurrency to help you get ready for your n...
Concurrency
13 CAP Theorem interview questions and answers for software engineers CAP Theorem
In theoretical computer science, the CAP theorem, also named Brewer's theorem after computer scientist Eric Brewer, states that it is impossible for a distributed data store to simultaneously provide more than two out of the following three guarantees: Consistency: Every read receives the ...
CAP Theorem
Load more posts
Features
Access all answers
Get the inside track on what to expect in your next tech interview. We offer you a collection of high quality technical interview questions to help you prepare for your next coding interview.
Track progress
A smart interface helps you track your progress and focus on the topics you need. You can search through questions or sort them by difficulty or type.
Save time
Save tens of hours searching for information on hundreds of low-quality sites designed to drive traffic and make money from advertising.
Land a six-figure job at one of the top companies.
Prepare for a technical interview
Get hired with our
tech interview questions & answers
