Why Linked List Exists and What Problem It Solves in DSA Typescript - Why This Pattern

Mental Model

A linked list is a chain of connected boxes where each box points to the next one, allowing easy adding or removing without shifting everything.

Analogy: Imagine a treasure hunt where each clue points to the next location. You don't need to rearrange all clues if you add or remove one; just change the pointer.

Head -> [1] -> [2] -> [3] -> null

Dry Run Walkthrough

Input: Array: [1, 2, 3], insert 0 at start

Goal: Show how linked list avoids shifting elements when inserting at the start

Step 1: Original array before insertion

[1, 2, 3]

Why: Arrays store elements in fixed positions; inserting at start means shifting all elements

Step 2: Insert 0 at start in array by shifting elements right

[0, 1, 2, 3]

Why: All elements must move one step right to make space, which takes time

Step 3: Original linked list before insertion

Head -> [1] -> [2] -> [3] -> null

Why: Linked list nodes point to next; no fixed positions

Step 4: Create new node with value 0 and point it to current head

NewNode[0] -> [1] -> [2] -> [3] -> null

Why: We only change pointers, no shifting needed

Step 5: Update head to new node

Head -> [0] -> [1] -> [2] -> [3] -> null

Why: Insertion done by changing head pointer only

Result:

Head -> [0] -> [1] -> [2] -> [3] -> null
Array after insertion: [0, 1, 2, 3]

Annotated Code

DSA Typescript

class Node {
  value: number;
  next: Node | null;
  constructor(value: number) {
    this.value = value;
    this.next = null;
  }
}

class LinkedList {
  head: Node | null;
  constructor() {
    this.head = null;
  }

  insertAtStart(value: number): void {
    const newNode = new Node(value);
    newNode.next = this.head; // point new node to current head
    this.head = newNode; // update head to new node
  }

  toString(): string {
    let result = '';
    let current = this.head;
    while (current !== null) {
      result += current.value + ' -> ';
      current = current.next;
    }
    return result + 'null';
  }
}

// Driver code
const arr = [1, 2, 3];
// Insert 0 at start in array by shifting elements
arr.unshift(0);

const list = new LinkedList();
list.insertAtStart(3);
list.insertAtStart(2);
list.insertAtStart(1);
list.insertAtStart(0);

console.log('Array after insertion:', arr);
console.log('Linked list after insertion:', list.toString());

newNode.next = this.head; // point new node to current head

link new node to current first node to keep chain

this.head = newNode; // update head to new node

move head pointer to new node to insert at start

Output

Array after insertion: [0,1,2,3]

Linked list after insertion: 0 -> 1 -> 2 -> 3 -> null

Complexity Analysis

Time: O(1) because inserting at start only changes pointers without shifting elements

Space: O(n) for storing n nodes, same as array but nodes are separate objects

vs Alternative: Compared to arrays, linked lists avoid costly shifting on insert/delete at start, making those operations faster

Edge Cases

Empty linked list

Insertion sets head to new node without errors

DSA Typescript

this.head = newNode; // update head to new node

Single element list

New node points to existing node, head updates correctly

DSA Typescript

newNode.next = this.head; // point new node to current head

When to Use This Pattern

When you need fast insertions or deletions at the start or middle without shifting elements, think of linked lists because they use pointers to connect nodes.

Common Mistakes

Mistake: Trying to insert by shifting elements in linked list like an array
Fix: Use pointer changes to insert nodes instead of moving data

Summary

Linked list stores elements as connected nodes using pointers.

Use linked lists when you want efficient insertions or deletions without shifting elements.

The key insight is that changing pointers is cheaper than moving many elements.

Practice

1. Why do we use a linked list instead of an array in some cases?

easy

A. Because linked lists allow easy insertion and deletion without shifting elements

B. Because linked lists use less memory than arrays always

C. Because linked lists store elements in contiguous memory locations

D. Because linked lists are faster for accessing elements by index

Solution

1. Step 1: Understand array limitations

   Arrays store elements in continuous memory, so inserting or deleting in the middle requires shifting many elements, which is slow.

2. Step 2: Understand linked list advantage

   Linked lists store elements as nodes with pointers, so insertion or deletion only changes pointers without shifting elements.

3. Final Answer:

   Because linked lists allow easy insertion and deletion without shifting elements -> Option A

4. Quick Check:

   Linked list insertion/deletion = easy [OK]

Hint: Linked lists avoid shifting elements on insert/delete [OK]

Common Mistakes:

• Thinking linked lists always use less memory
• Believing linked lists store elements contiguously
• Assuming linked lists have fast random access

2. Which of the following is the correct way to declare a node in a singly linked list in TypeScript?

easy

A. class Node { value: number; next: Node | null; constructor(value: number) { this.value = value; this.next = null; } }

B. class Node { value: number; next: Node; constructor(value: number) { this.value = value; this.next = null; } }

C. class Node { value: number; next: null; constructor(value: number) { this.value = value; this.next = null; } }

D. class Node { value: number; next: any; constructor(value: number) { this.value = value; this.next = undefined; } }

Solution

1. Step 1: Check next pointer type

   In a singly linked list, next can be another Node or null if it's the last node.

2. Step 2: Verify constructor initialization

   The constructor sets value and initializes next to null correctly.

3. Final Answer:

   class Node { value: number; next: Node | null; constructor(value: number) { this.value = value; this.next = null; } } -> Option A

4. Quick Check:

   Node next type = Node or null [OK]

Hint: Next pointer must allow null for last node [OK]

Common Mistakes:

• Not allowing next to be null
• Setting next to undefined instead of null
• Using any type for next pointer

3. What will be the output of the following TypeScript code that uses a linked list?

class Node {
  value: number;
  next: Node | null;
  constructor(value: number) {
    this.value = value;
    this.next = null;
  }
}

const head = new Node(1);
head.next = new Node(2);
head.next.next = new Node(3);

let current = head;
const values: number[] = [];
while (current !== null) {
  values.push(current.value);
  current = current.next;
}
console.log(values);

medium

A. []

B. [3, 2, 1]

C. [1, 2]

D. [1, 2, 3]

Solution

1. Step 1: Build linked list nodes

   Nodes created with values 1, 2, 3 linked in order: 1 -> 2 -> 3 -> null.

2. Step 2: Traverse linked list and collect values

   Loop visits nodes in order: 1, then 2, then 3, pushing values into array.

3. Final Answer:

   [1, 2, 3] -> Option D

4. Quick Check:

   Traversal order = [1, 2, 3] [OK]

Hint: Traverse from head to null to get values in order [OK]

Common Mistakes:

• Confusing order and reversing output
• Stopping traversal too early
• Not initializing next pointers correctly

4. The following TypeScript code tries to insert a new node with value 4 at the end of the linked list but has a bug. What is the bug?

class Node {
  value: number;
  next: Node | null;
  constructor(value: number) {
    this.value = value;
    this.next = null;
  }
}

const head = new Node(1);
head.next = new Node(2);
head.next.next = new Node(3);

function insertAtEnd(head: Node, value: number) {
  let current = head;
  while (current.next !== null) {
    current = current.next;
  }
  current = new Node(value);
}

insertAtEnd(head, 4);

let current = head;
const values: number[] = [];
while (current !== null) {
  values.push(current.value);
  current = current.next;
}
console.log(values);

medium

A. The function should return the new head node

B. The new node is not linked to the last node; assignment should be current.next = new Node(value)

C. The while loop condition should be current !== null

D. The new node value should be assigned before the loop

Solution

1. Step 1: Analyze insertion logic

   The code moves current to last node, but then assigns current = new Node(value), which only changes local variable, not the list.

2. Step 2: Correct pointer assignment

   To link new node, must assign current.next = new Node(value) so last node points to new node.

3. Final Answer:

   The new node is not linked to the last node; assignment should be current.next = new Node(value) -> Option B

4. Quick Check:

   Link new node with current.next = new Node(value) [OK]

Hint: Assign new node to current.next, not current [OK]

Common Mistakes:

• Assigning new node to current variable only
• Wrong loop condition causing null errors
• Expecting function to return new head unnecessarily

5. You want to store a list of tasks where you often add or remove tasks from the middle. Which data structure is best and why? A linked list or an array? Choose the best option.

hard

A. Array, because it uses less memory than linked lists

B. Array, because it allows fast random access to any task by index

C. Linked list, because it allows efficient insertion and deletion in the middle without shifting elements

D. Linked list, because it stores elements in contiguous memory for cache efficiency

Solution

1. Step 1: Understand operation needs

   Adding/removing tasks often in the middle means many insertions and deletions not at the end.

2. Step 2: Compare array vs linked list for middle operations

   Arrays require shifting elements on insert/delete in middle, which is slow. Linked lists only change pointers, so faster for these operations.

3. Final Answer:

   Linked list, because it allows efficient insertion and deletion in the middle without shifting elements -> Option C

4. Quick Check:

   Middle insert/delete = linked list best [OK]

Hint: For frequent middle changes, linked list is faster [OK]

Common Mistakes:

• Choosing array for fast random access ignoring insert/delete cost
• Thinking linked lists use less memory always
• Believing linked lists store elements contiguously