Month 4 · Week 14 of 40

Singly & Doubly Linked Lists

Build non-contiguous dynamic data structures.

Enroll Now to Start Week 14 View Month 4 Overview

Week Overview

Implement linked lists from scratch. Learn node allocation, pointer splicing, cycle detection (Floyd's algorithm), and reversing lists in-place.

Core Concepts & Topics

Singly Linked List Implementation

Doubly Linked List (prev & next pointers)

Fast & Slow Pointers (Floyd's Cycle Detection)

Reversing a Linked List In-Place

Merging Two Sorted Lists

Hands-On Challenge

Week 14 Project: Doubly linked list LRU (Least Recently Used) cache simulation.

Every week at DoxaTech Hub requires submitting real working code tested by our automated grading suite. You will push code to your personal GitHub repository, open pull requests, and receive instant feedback.

Frequently Asked Questions

Why use a linked list instead of an array?

Linked lists provide O(1) insertion and deletion at any point once you have a pointer to the node, without requiring elements to shift in memory.

Week 13: Big O Notation & Array Algorithms

Week 15: Stacks, Queues & Hash Tables

Interactive Learning

Ready to Build This?

Sign up now to access full video lessons, downloadable study PDFs, autograded programming challenges, and mentor support.

Start Learning Today View Pricing Plans

Month 4 Modules

This week is part of Data Structures & Algorithms.

Explore Full Month 4