Linked List Data Structure

Last Updated : 04 Jan, 2025

A linked list is a fundamental data structure in computer science. It mainly allows
efficient insertion and deletion operations compared to arrays. Like arrays, it is
also used to implement other data structures like stack, queue and deque. Here’s
the comparison of Linked List vs Arrays

Linked List:

Data Structure: Non-contiguous

Memory Allocation: Typically allocated one by one to individual elements
Insertion/Deletion: Efficient
Access: Sequential
Array:

Data Structure: Contiguous

Memory Allocation: Typically allocated to the whole array
Insertion/Deletion: Inefficient
Access: Random
Basics of Linked List:
Singly Linked List
Doubly Linked List
Circular Linked List
Applications and Advantages of Linked List
Operations of Linked Lists:
Length of Linked List
Print Linked List
Linked List Insertion
Search in a Linked List
Deleting a given key
Deleting at given position
Delete a Linked List
Nth Node from Start
Nth Node from End
Size of Doubly Linked List
Easy Problems on Linked List:
Remove every k-th node
Middle of a Linked List
Count Occurrences in a Linked List
Circular Linked List Traversal
Check if Circular
Count Nodes in Circular List
Deletion from a Circular Linked List
Singly to circular Conversion
Exchange first and last nodes in Circular
Delete in a Doubly Linked List
Reverse a Singly Linked List
Reverse a Doubly Linked List
Medium Problems on Linked List:
Swap Nodes in Pairs
Detect loop in a linked list
Length of loop in linked list
Design Browser History
Remove duplicates from a sorted linked list
Remove Duplicates from an Unsorted Linked List
Intersection of two Sorted Linked Lists
Partition a List
QuickSort on Singly Linked List
Split a Circular Linked List into two halves
Merge Two Sorted Linked Lists
Union and Intersection
Merge Sort for Doubly Linked List
Pairs with Sum in doubly linked list
Insert in sorted way in doubly linked list
Remove duplicates from an unsorted DLL
Rotate a Linked List
Rotate Doubly linked list by N nodes
Delete a node with only its pointer given
Segregate even and odd nodes
Hard Problems on Linked List:
Merge K Sorted Lists
Intersection point of two Linked Lists.
Implement LRU Cache
Josephus Circle using circular linked list
The Great Tree-List Recursion Problem.
Clone a linked list with random pointer
Binary Tree to Doubly Linked List | Set
Reverse a Singly Linked List in Groups
Reverse a Doubly Linked List in Groups
Sublist Search (Search a linked list in another list)
Construct a linked list from 2D matrix
Rotate Linked List block wise
Multiply two numbers represented by Lists
Delete N nodes after M nodes
Quick Links :

‘Practice Problems’ on Linked List

‘Videos’ on Linked List
‘Quizzes’ on Linked List
Recommended:

Learn Data Structure and Algorithms | DSA Tutorial pointer

Problems with Array Data Structure

Visit Course
explore course icon
Master Data Structures and Algorithms at your own pace with our DSA Self-Paced
course. In just 90 days, you’ll cover core concepts, solve real-world problems, and
sharpen your problem-solving skills. Take the Three 90 Challenge: complete 90% of
the course in 90 days and get a 90% refund. Stay motivated, track progress, and
achieve DSA mastery. Start today!

Comment

More info

Placement Training Program

Next Article
Basic Terminologies of Linked List
Similar Reads
Static Data Structure vs Dynamic Data Structure
Data structure is a way of storing and organizing data efficiently such that the
required operations on them can be performed be efficient with respect to time as
well as memory. Simply, Data Structure are used to reduce complexity (mostly the
time complexity) of the code. Data structures can be two types : 1. Static Data
Structure 2. Dynamic Data
4 min read
Commonly Asked Data Structure Interview Questions on Heap Data Structure
A heap is a complete binary tree that maintains a specific order, making it
efficient for priority-based operations. It is mainly of two types:Min Heap: The
smallest value is at the root, and each parent is smaller than its children.Max
Heap: The largest value is at the root, and each parent is larger than its
children.Heaps are commonly stored as
4 min read
Applications of linked list data structure
A linked list is a linear data structure, in which the elements are not stored at
contiguous memory locations. The elements in a linked list are linked using
pointers as shown in the below image: Linked-ListApplications of linked list in
computer science:Implementation of stacks and queuesImplementation of graphs:
Adjacency list representation of
5 min read
Top 50 Problems on Linked List Data Structure asked in SDE Interviews
A Linked List is a linear data structure that looks like a chain of nodes, where
each node is a different element. Unlike Arrays, Linked List elements are not
stored at a contiguous location. Here is the collection of the Top 50 list of
frequently asked interview questions on Linked Lists. Problems in this Article are
divided into three Levels so t
3 min read
Commonly Asked Data Structure Interview Questions on Linked List
Unlike arrays, which are stored in contiguous memory locations, linked lists
consist of nodes, where each node contains data and a reference (or link) to the
next node in the sequence. This structure provides advantages in terms of dynamic
memory allocation, and easy insertion, and deletion of elements, particularly in
scenarios where the size of t
6 min read
Difference between data type and data structure
Data Type A data type is the most basic and the most common classification of data.
It is this through which the compiler gets to know the form or the type of
information that will be used throughout the code. So basically data type is a type
of information transmitted between the programmer and the compiler where the
programmer informs the compile
4 min read
Is array a Data Type or Data Structure?
What is Data Type? In computer programming, a data type is a classification of data
that determines the type of values that can be stored, manipulated, and processed.
It tells the computer what kind of data a particular variable or constant can hold,
and what operations can be performed on that data. Common data types include
integers, floating-poi
8 min read
Data Structure Alignment : How data is arranged and accessed in Computer Memory?
Data structure alignment is the way data is arranged and accessed in computer
memory. Data alignment and Data structure padding are two different issues but are
related to each other and together known as Data Structure alignment. Data
alignment: Data alignment means putting the data in memory at an address equal to
some multiple of the word size.
4 min read
Node Structure and Representation of Singly Linked List
A singly linked list is a data structure that consists of nodes, where each node
contains two parts: a data field that holds the actual value and a pointer that
points to the next node in the list. This structure allows for efficient insertion
and deletion of elements, making it a flexible way to manage data collections.
Table of ContentNode Struct
7 min read
Insert a linked list into another linked list
Given two linked lists, head1 and head2 of sizes m and n respectively. The task is
to remove head1's nodes from the ath node to the bth node and insert head2 in their
place.Examples:Input: a = 3, b = 4head1: 10 -> 11 -> 12 -> 13 -> 14 -> 15, head2:
100 -> 101 -> 102 -> 103Output: 10 -> 11 -> 12 -> 100 -> 101 -
10 min read
course-img
81k+ interested Geeks
DSA for Interview Preparation
Avail 90% Refund
course-img
42k+ interested Geeks
Complete Data Analytics Program
Avail 90% Refund
course-img
25k+ interested Geeks
Placement Preparation Crash Course - Live
Avail 90% Refund
course-img
326k+ interested Geeks
Tech Interview 101 - From DSA to System Design for Working Professionals
Avail 90% Refund
course-img
226 interested Geeks
GATE CSE + DA Complete Course Combo [2028]
Avail 90% Refund

geeksforgeeks-footer-logo
Corporate & Communications Address:
A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh
(201305)
Registered Address:
K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar,
Uttar Pradesh, 201305
GFG App on Play Store
GFG App on App Store
Advertise with us
Company
About Us
Legal
Privacy Policy
Careers
In Media
Contact Us
GfG Corporate Solution
Placement Training Program
Explore
Job-A-Thon Hiring Challenge
Hack-A-Thon
GfG Weekly Contest
Offline Classes (Delhi/NCR)
DSA in JAVA/C++
Master System Design
Master CP
GeeksforGeeks Videos
Geeks Community
Languages
Python
Java
C++
PHP
GoLang
SQL
R Language
Android Tutorial
DSA
Data Structures
Algorithms
DSA for Beginners
Basic DSA Problems
DSA Roadmap
DSA Interview Questions
Competitive Programming
Data Science & ML
Data Science With Python
Data Science For Beginner
Machine Learning
ML Maths
Data Visualisation
Pandas
NumPy
NLP
Deep Learning
Web Technologies
HTML
CSS
JavaScript
TypeScript
ReactJS
NextJS
NodeJs
Bootstrap
Tailwind CSS
Python Tutorial
Python Programming Examples
Django Tutorial
Python Projects
Python Tkinter
Web Scraping
OpenCV Tutorial
Python Interview Question
Computer Science
GATE CS Notes
Operating Systems
Computer Network
Database Management System
Software Engineering
Digital Logic Design
Engineering Maths
DevOps
Git
AWS
Docker
Kubernetes
Azure
GCP
DevOps Roadmap