Arrays Linked Lists and Stacks

About this course

Static/dynamic arrays, singly/doubly linked lists, stacks, queues, deques. Time complexity analysis.

• 20 lessons
• 2 h
• intermediate

What you'll learn

• Understand the course roadmap and expected outcomes
• Recognize the impact of data structure choices on performance
• Explain the memory representation of static arrays
• Analyze the time complexity of access, insertion, and deletion in static arrays
• Describe how dynamic arrays handle growth
• Perform amortized analysis for dynamic array operations

Finishing the course

• 80 knowledge-check questions along the way, so you know the ideas stuck before you move on.
• Watching is free and needs no account. Sign in to save your progress. Pass each lesson's quiz (60%+) to earn the certificate. Each certificate has its own public verification link to share, marked quiz-verified.

Created by