Learning Path
Blogs
Premium
Login
Feedback
Hide Index
Doubly Linked List
0% completed
Introduction to doubly linked lists
Understanding the problem
Exploring a possible solution
Defining a node in doubly linked list
Structure of a doubly linked list
Overview of supported operations
Traversal in doubly linked lists
Understanding traversal
Node expedition
Node expedition II
Node search
Insertion in doubly linked lists
Understanding insertion at beginning
Insert at beginning
Understanding insertion at end
Insert at end
Understanding insertion after the given node
Insert after the given node
Understanding insertion before a given node
Insert before the given node
Understanding insertion at a given distance
Insert at given distance
Deletion in doubly linked lists
Understanding deletion of first node
Delete first node
Understanding deletion of last node
Delete last node
Understanding deletion by given data
Delete node with given data
Delete nodes with given data
Understanding deletion after a given node
Delete node after the given node
Understanding deletion before a given node
Delete node before the given node
Understanding deletion of the given node
Delete the given node
Understanding deletion at a given distance
Delete node at given distance
Pattern: Reversal
Understanding the reversal pattern
Identifying direct aplication
Reverse a list
new
Reverse first K nodes
new
Reverse last K nodes
new
Reverse the given segment
Pattern: Reversal (Subproblem)
Identifying reversal subproblem
Pairwise swap
new
Reverse K-segments
new
Reverse increasing groups
new
Reverse alternate segments
Pattern: Two pointers
Understanding the two pointer pattern
Identifying the two pointer pattern
new
Palindrome number
Two sum
new
Duplicate aware two sum
new
Approximate three sum
Pattern: Reorder
Understanding the reorder pattern
Identifying the reorder pattern
Relocate node
new
Parity order
Value partition
Shuffle list
Design
Design a doubly linked list
Assessments
Assessment 1
Assessment 2
Certificate
Certificate