Learning Path
Blogs
Premium
Login
Send
Hide Index
Doubly Linked List
0% completed
Introduction
What's the problem
A possible solution
What is a node?
Structure of a doubly linked list
Supported operations
Traversal
Ways to traverse
Node expedition
Node expedition II
Node search
Insertion
Insert at beginning
Insert at end
Insert after the given node
Insert before the given node
Insert at given distance
Node placement
Clone a list
Clone a list II
Deletion
Delete first node
Delete last node
Delete a list
Delete node with given data
Delete nodes with given data
Delete node after the given node
Delete node before the given node
Delete the given node
Delete node at given distance
Deduplicate list
Pattern: Reverse
Pairwise swap
Reverse a linked list
Pattern: Simultaneous Traversal
Trim Nth node
Pattern: Two pointer
Two sum
Swap Nth nodes
Pattern: Split & Merge
Relocate node
K rotations
Shuffle list
Value partition
Pattern: Design
Design a doubly linked list
Assessments
Assessment 1
Assessment 2
Certificate
Certificate
Liking the course? Start a
FREE
trial to continue learning.
Start free trial