Learning Path
Blogs
Premium
Login
Send
Hide Index
Singly Linked List
0% completed
Introduction
What's the problem
A possible solution
What is a node?
Structure of a singly linked list
Supported operations
Boundary node
Traversal
What is traversal?
Array vs linked list
Node expedition
Length of the list
Node search
Node search II
Insertion
Clone a list
Insert at beginning
Insert at end
Insert after the given node
Insert before the given node
Insert at given distance
Node placement
Add single number
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
Delete nodes in intervals
Pattern: Reversal
What is the reversal pattern?
How to approach this pattern?
Pairwise swap
Reverse a list
Reverse the given segment
Reverse K-segments
Reverse alternate segments
Pattern: Simultaneous Traversal
What is the simultaneous traversal pattern?
How to approach this pattern?
Trim Nth node
Swap Nth nodes
Intersection point
Pattern: Fast and Slow Pointers
What is the fast and slow pointers pattern?
How to approach this pattern?
Middle node search
Detect cycle
Detect cycle II
Remove loop
Palindrome checker II
Pattern: Split
What is the split pattern?
How to approach this pattern?
Split list in half
K-way list split
Pattern: Merge
Alternate node fusion
Merge sorted lists
Merge sorted lists II
List addition
K-way list merge
Pattern: Split & Merge
Relocate node
Parity split
Parity split II
K rotations
Shuffle list
Value partition
Pattern: Design
Design a singly linked list
Assessments
Assessment 1
Assessment 2
Certificate
Certificate