Linked List - Data Structures Series #5
In this course, you will learn about the Linked List data structure, create a Linked List from zero using your preferred language, and practice coding challenges with it!
Topics
Syllabus
3 chapters14 lessons1 project12 challengesIntroduction
2 lessonsLinked List Project
7 lessonsPractice Challenges
5 lessonsMore like this
Doubly Linked List - Data Structures Series #6
In this course, you will learn about the Doubly Linked List data structure, create a Doubly Linked List from zero using your preferred language, and practice coding challenges with it!
Certificate on completion
- 14
- 12
- 1
Stack - Data Structures Series #1
In this course, you will learn about the Stack data structure, create a Stack from zero using your preferred language, and practice coding challenges with it!
- 13
- 11
- 1
Hash Tables - Data Structures Series #4
In this course, you will learn about the Hash Table data structure, create a Hash Table from zero using your preferred language, and practice coding challenges with it!
Certificate on completion
- 14
- 12
Queue - Data Structures Series #2
In this course, you will learn about the Queue data structure, create a Queue from zero using your preferred language, and practice coding challenges with it!
- 12
- 10
- 1
Binary Tree - Data Structures Series #3
In this course, you will learn about the Binary Tree data structure, create a Binary Tree from zero using your preferred language, and practice coding challenges with it!
- 13
- 11
- 1
Frequently asked questions
How many lessons does Linked List - Data Structures Series #5 have?
Linked List - Data Structures Series #5 contains 14 interactive lessons you can complete at your own pace.
What does Linked List - Data Structures Series #5 cover?
The course is organized into chapters covering: Introduction, Linked List Project, Practice Challenges.
Is Linked List - Data Structures Series #5 free?
Yes. Every course on Coddy is free to start. You can complete lessons in your browser without any downloads or signup.
