codeintuition-logo
Learning order

1. Array

Free

Start your learning journey by understanding the most fundamental data structure.

Show Index

2. Singly Linked List

Free

Learn in-depth the most fundamental data structure in a programmer's life

Show Index

3. Doubly Linked List

Premium

Learn about the extension of the singly linked list that powers stacks and queues

Show Index

4. Hash Table

Premium

Learn how applications deal with key value mappings efficiently

Show Index

5. Stack

Premium

The data structure behind recursion, memory management, and much more

Show Index

6. Queue

Premium

Learn about the data structure that powers CPU and disk scheduling algorithms

Show Index

7. Binary Tree

Premium

Learn all about the most critical data structure in computer science

Show Index

8. Binary Search Tree

Premium

Learn about the most critical search data structure in computer science

Show Index

9. Heap

Premium

Learn all how a tree can be used as a priority queue

Show Index

10. Graph

Premium

Learn about the most dynamic data structure in computer science

(Early Access)

Show Index

What you will learn

Structure, representation and implementation of a doubly linked list

The fundamental traversal, insertion and deletion operations

Understand essential patterns behind common interview problems

Detailed code implementation and solution of all problems

Intuition through visual explanation of algorithms

Hands on practical experience in a setup free coding environment

Requirements

This is a complete course and assumes that you know nothing about doubly linked lists but are familiar with some basic foundational topics in any programming language.

  • Basic knowledge of programming in any language
  • Basic knowledge of functions and classes
  • Basic knowledge of memory management
  • You have completed the singly linked list course

Overview

Data structures are used extensively in software development, and a linked list is the most fundamental of all data structures. Irrespective of your language, framework, or system, you will always be using a linked list in some form or another. 

Loading Image

Representation of a doubly linked list

Fundamentals

This course teaches you the fundamentals of a doubly linked list and how it works. It provides you with code implementations and detailed explanations of a doubly linked list and its operations in the most intuitive way. We explore its various functions step by step, giving you a deep insight into this awesome data structure. This will help you thoroughly understand the most important data structure of all.

Problems Solving

This interactive course involves high-quality problems and is deeply focused on problem-solving. It bridges the gap between theoretical concepts and common interview problems by explaining the most common interview problems on doubly linked list. This will help you gain confidence and understand how to convert your learning into action. By the end of the course, you will be pretty confident that you can solve any doubly linked list problem thrown at you.

Who this course is for

This all-rounder course targets a variety of audiences ranging from complete beginners to experienced programmers who want to take their knowledge to the next level. You will greatly benefit from this course if you identify yourself as one of the following

  • Non developers who want to start their journey to learn data structures
  • Developers who want to get deepest knowledge of doubly linked list
  • Anyone interested in improving their problem solving skills
  • Anyone preparing for programming interviews

Course Contents

1. Introduction to doubly linked lists

0%

2. Traversal in doubly linked lists

0%

3. Insertion in doubly linked lists

0%

4. Deletion in doubly linked lists

0%

5. Pattern: Reversal

0%

6. Pattern: Two pointer

0%

7. Pattern: Reorder

0%

8. Pattern: Design

0%

9. Assessments

0%

10. Certificate

Forever offer!: 70% OFF

Annual

$4

.97

/MO

Billed annualy at$199$59.7

Unlimited access
Code execution
Detailed solutions
Incremental Learning Path
High quality lessons

Completion Time: 6 hour
Difficulty: Easy
Level: Beginner

Doubly Linked List

Learn about the extension of the singly linked list that powers stacks and queues

25 Lessons
34 problems
4 Patterns
10 Illustrations