Milestone 2: Linear Data Structures

🟨 Milestone 2: Linear Data Structures

In this milestone, we explore the most fundamental ways to store data in a sequence. Understanding how these work in RAM is the key to choosing the right tool for the job.

📚 Slow-Paced Deep Dives (University Modules)

• Module 1: Arrays (The Train Cars): DSA-103. Static vs Dynamic arrays and the cost of insertion.
• Module 2: Linked Lists (The Treasure Hunt): DSA-104. Singly and Doubly linked lists.

🥅 Milestone Goals

1. Understand why accessing an Array element is O(1).
2. Contrast the memory layout of Arrays vs Linked Lists.
3. Perform Insertions and Deletions at different positions.
4. Implement a simple Singly Linked List from scratch.

:::tip Senior Tip Arrays are great for Reading data. Linked Lists are great for Inserting/Deleting data in the middle. Pick your weapon based on the task! :::