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

Ways to traverse a doubly linked list

Node expedition

Node expedition II

Insertion in doubly 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 a given node

Insert before the given node

Understanding insertion at a given distance

Insert at given distance

Clone a list II

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

Deduplicate list

Pattern: Reversal

Understanding the reversal pattern

Identifying direct aplication

newReverse the given segment

Identifying reversal subproblem

newReverse K-segments

newReverse alternate segments

Pattern: Two pointer

Understanding the two pointer pattern

Identifying the two pointer pattern

newDuplicate aware two sum

newApproximate three sum

Pattern: Reorder

Understanding the reorder pattern

Identifying the reorder pattern

newParity order

Value partition

Pattern: Design

Design a doubly linked list

Assessments

Certificate

Liking the course? Check our discounted plans to continue learning.