Learning Path
Blogs
Premium
Login
Send
Hide Index
Singly Linked List
0% completed
Introduction to singly linked lists
Understanding the problem
Exploring a possible solution
Defining a node in singly linked list
Structure of a singly linked list
Overview of supported operations
Boundary node
Traversal in singly linked lists
Understanding traversal
Node expedition
Node search
Length of the list
Insertion in singly 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 the given node
Insert before the given node
Understanding insertion at a given distance
Insert at given distance
Deletion in singly 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
Detecting cycle in singly linked lists
Understanding Floyd's cycle finding algorithm
Detect cycle
Remove loop
Pattern: Reversal
Understanding the reversal pattern
Identifying direct application
Reverse a list
new
Reverse first K nodes
new
Reverse last K nodes
Reverse the given segment
Pattern: Reversal (Subproblem)
Identifying reversal subproblem
Pairwise swap
Reverse K-segments
new
Reverse increasing groups
Reverse alternate segments
Pattern: Sliding window traversal
Understanding sliding window traversal pattern
Identifying the sliding window traversal pattern
new
K maximum sum
Trim Nth node
Swap Nth nodes
K rotations
Pattern: Fast and slow pointers
Understanding the fast and slow pointer pattern
Identifying the fast and slow pointer pattern
Middle node search
Split list in half
new
Equal halves
Palindrome checker
Pattern: Split
Understanding the split pattern
Identifying the split pattern
new
Even odd split
new
Split alternate groups
new
Split by modulo
K-way list split
Pattern: Merge
Understanding the merge pattern
Identifying the merge pattern
Alternate node fusion
Merge sorted lists
Merge sorted lists II
List addition
Pattern: Reorder
Understanding the reorder pattern
Identifying the reorder pattern
Relocate node
Parity order
Value partition
Shuffle list
Design
Design a singly linked list
Assessments
Assessment 1
Assessment 2
Certificate
Certificate
You need to login to view this page
Login
