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

Traversal in singly linked lists

Traversal in singly linked list

Array and linked list traversal

Node expedition

Length of the list

Intersection point

Insertion in singly linked lists

Understanding insertion at beginning

Insert at beginning

Understanding insertion 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

Pattern: Reversal

Understanding the reversal pattern

Identifying direct application

newReverse first K nodes

newReverse last K nodes

Reverse the given segment

Pattern: Reversal (Subproblem)

Identifying reversal subproblem

Reverse K-segments

newReverse increasing groups

Reverse alternate segments

Pattern: Sliding window traversal

Understanding sliding window traversal pattern

Identifying the sliding window traversal pattern

newK maximum sum

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

newEqual halves

Palindrome checker

Pattern: Split

Understanding the split pattern

Identifying the split pattern

newEven odd split

newSplit alternate groups

newSplit 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

Pattern: Reorder

Understanding the reorder pattern

Identifying the reorder pattern

Value partition

Design

Design a singly linked list

Assessments

Certificate