Arrays vs Other Data Structures When to Choose Arrays in DSA Typescript - Trade-offs & Analysis

Mental Model

Arrays store items in order, like boxes in a row, so you can quickly find any box by its position.

Analogy: Imagine a row of mailboxes where each mailbox has a number. You can open mailbox 3 directly without checking mailbox 1 or 2 first.

Index: 0   1   2   3   4
Array: [A] [B] [C] [D] [E]

Dry Run Walkthrough

Input: Array of letters ['A', 'B', 'C', 'D', 'E'], want to get the letter at position 3

Goal: Show how arrays let you quickly access any item by its position

Step 1: Look at the array and find the position 3

Index: 0   1   2   3   4
Array: [A] [B] [C] [D] [E] ↑

Why: We want to find the item at position 3 quickly

Step 2: Access the item directly at index 3

Index: 0   1   2   3   4
Array: [A] [B] [C] [D] [E] ↑ (selected 'D')

Why: Arrays let us jump straight to any position without checking others

Step 3: Return the item 'D' found at position 3

Index: 0   1   2   3   4
Array: [A] [B] [C] [D] [E]

Why: We got the item we wanted quickly and easily

Result:

Index: 0   1   2   3   4
Array: [A] [B] [C] [D] [E]
Answer: 'D'

Annotated Code

DSA Typescript

class ArrayExample {
  private data: string[];

  constructor(items: string[]) {
    this.data = items;
  }

  getItemAt(index: number): string | null {
    if (index < 0 || index >= this.data.length) {
      return null; // index out of bounds
    }
    return this.data[index]; // direct access by index
  }
}

// Driver code
const letters = new ArrayExample(['A', 'B', 'C', 'D', 'E']);
const item = letters.getItemAt(3);
console.log(item !== null ? item : 'Index out of range');

if (index < 0 || index >= this.data.length) {

check if index is valid to avoid errors

return this.data[index];

directly access the item at the given index for fast retrieval

Output

D

Complexity Analysis

Time: O(1) because arrays allow direct access to any position without scanning

Space: O(n) because arrays store all n items in a continuous block

vs Alternative: Compared to linked lists, arrays provide faster access by index but slower insertions/deletions in the middle

Edge Cases

index is negative or greater than last position

returns null or error message to prevent invalid access

DSA Typescript

if (index < 0 || index >= this.data.length) {

empty array

any index access returns null because no items exist

DSA Typescript

if (index < 0 || index >= this.data.length) {

When to Use This Pattern

When you need fast access to items by position and know the number of items in advance, choose arrays for their direct indexing speed.

Common Mistakes

Mistake: Trying to access an index outside the array bounds causing errors
Fix: Always check if the index is within 0 and array length minus one before accessing

Summary

Arrays store items in order and let you quickly get any item by its position.

Use arrays when you need fast access by index and the size is mostly fixed.

The key is that arrays let you jump directly to any position without checking others.

Practice

1. Which of the following is the best reason to choose an array over other data structures like linked lists or trees?

easy

A. You need to store key-value pairs.

B. You need fast access to elements by index.

C. You want to insert elements frequently in the middle.

D. You want to maintain a sorted order automatically.

Solution

1. Step 1: Understand array access speed

   Arrays allow direct access to elements using their index in constant time (O(1)).

2. Step 2: Compare with other structures

   Linked lists or trees do not provide constant time index access; they require traversal.

3. Final Answer:

   You need fast access to elements by index. -> Option B

4. Quick Check:

   Fast index access = Array [OK]

Hint: Arrays excel at fast index access, unlike linked lists [OK]

Common Mistakes:

• Choosing arrays for frequent middle insertions
• Confusing arrays with key-value stores
• Assuming arrays keep data sorted automatically

2. Which of the following is the correct way to declare an array of numbers in TypeScript?

easy

A. let arr = {1, 2, 3};

B. let arr: array = (1, 2, 3);

C. let arr: number[] = [1, 2, 3];

D. let arr: number = [1, 2, 3];

Solution

1. Step 1: Recall TypeScript array syntax

   Arrays of numbers are declared as number[] with square brackets after the type.

2. Step 2: Check each option

   let arr: number[] = [1, 2, 3]; uses correct syntax: let arr: number[] = [1, 2, 3];. Others have syntax errors or wrong types.

3. Final Answer:

   let arr: number[] = [1, 2, 3]; -> Option C

4. Quick Check:

   TypeScript array syntax = let arr: number[] = [1, 2, 3]; [OK]

Hint: Use type[] to declare arrays in TypeScript [OK]

Common Mistakes:

• Using parentheses instead of square brackets
• Assigning array to a non-array type
• Using curly braces which define objects

3. What will be the output of the following TypeScript code?

const arr = [10, 20, 30, 40];
console.log(arr[2]);
arr[2] = 50;
console.log(arr);

medium

A. 30 and then [10, 20, 50, 40]

B. [10, 20, 30, 40] and then [10, 20, 50, 40]

C. 30 and then [10, 20, 30, 40]

D. Error because arrays are immutable

Solution

1. Step 1: Check first console.log output

   Accessing arr[2] returns the third element, which is 30.

2. Step 2: Update array and check second console.log

   Setting arr[2] = 50 changes the third element. Printing arr shows [10, 20, 50, 40].

3. Final Answer:

   30 and then [10, 20, 50, 40] -> Option A

4. Quick Check:

   Index access then update = 30 and then [10, 20, 50, 40] [OK]

Hint: Arrays allow element update by index directly [OK]

Common Mistakes:

• Thinking arrays are immutable in TypeScript
• Confusing index 2 with index 3
• Expecting original array after update

4. Identify the error in the following TypeScript code that tries to add an element to an array:

const numbers = [1, 2, 3];
numbers.add(4);

medium

A. The array must be initialized with 'new Array()' to add elements.

B. The array should be declared with 'let' to add elements.

C. The number 4 must be inside square brackets.

D. Arrays don't have an 'add' method; use 'push' instead.

Solution

1. Step 1: Check method used on array

   The method add does not exist for arrays in TypeScript or JavaScript.

2. Step 2: Identify correct method to add elements

   To add elements, use push method like numbers.push(4).

3. Final Answer:

   Arrays don't have an 'add' method; use 'push' instead. -> Option D

4. Quick Check:

   Use push, not add, to add array elements [OK]

Hint: Use push() to add elements to arrays [OK]

Common Mistakes:

• Using non-existent 'add' method
• Thinking 'let' is required to modify array contents
• Trying to add elements with wrong syntax

5. You need to store a large collection of items where you frequently access elements by index and rarely insert or delete items. Which data structure should you choose and why?

hard

A. Array, because it provides fast index-based access and low memory overhead.

B. Linked List, because it allows fast insertions and deletions.

C. Hash Map, because it stores key-value pairs efficiently.

D. Binary Tree, because it keeps data sorted automatically.

Solution

1. Step 1: Analyze access and modification needs

   Frequent index-based access means we want constant time access by position.

2. Step 2: Compare data structures for this use case

   Arrays provide O(1) access by index and use less memory. Insertions/deletions are rare, so array's slower modification is acceptable.

3. Final Answer:

   Array, because it provides fast index-based access and low memory overhead. -> Option A

4. Quick Check:

   Fast index access + rare changes = Array [OK]

Hint: Choose arrays for fast index access and few modifications [OK]

Common Mistakes:

• Choosing linked list despite rare insertions
• Confusing hash maps with index-based access
• Assuming binary trees are best for all data