Hash Map vs Array vs Linked List for Lookup in DSA C# - Complexity Comparison

Time Complexity: Hash Map vs Array vs Linked List for Lookup

O(n) for array and linked list, O(1) for hash map

Understanding Time Complexity

We want to understand how fast we can find an item in different data structures.

How does the time to look up a value change as the data grows?

Scenario Under Consideration

Analyze the time it takes to find a value in these structures.

// Lookup in an array
int FindInArray(int[] arr, int target) {
  for (int i = 0; i < arr.Length; i++) {
    if (arr[i] == target) return i;
  }
  return -1;
}

// Lookup in a linked list
class Node {
  public int Value; public Node Next;
}
int FindInLinkedList(Node head, int target) {
  Node current = head;
  while (current != null) {
    if (current.Value == target) return 1;
    current = current.Next;
  }
  return -1;
}

// Lookup in a hash map
bool FindInHashMap(Dictionary map, int key) {
  return map.ContainsKey(key);
}
    

This code shows how we search for a value in an array, linked list, and hash map.

Identify Repeating Operations

Look at what repeats when searching:

• Array: Loop through each element one by one.
• Linked List: Move from one node to the next until found.
• Hash Map: Directly check if the key exists without looping.
• Dominant operation: The loops in array and linked list; hash map uses direct access.

How Execution Grows With Input

As the data size grows, the search time changes differently:

Input Size (n)	Array/Linked List Operations	Hash Map Operations
10	Up to 10 checks	About 1 check
100	Up to 100 checks	About 1 check
1000	Up to 1000 checks	About 1 check

Pattern observation: Array and linked list search time grows linearly with size; hash map stays almost constant.

Final Time Complexity

Time Complexity: O(n) for array and linked list, O(1) for hash map

This means searching in array or linked list takes longer as data grows, but hash map lookup stays fast.

Common Mistake

[X] Wrong: "Hash map lookup always takes no time at all because it's magic."

[OK] Correct: Hash maps usually take constant time, but collisions or poor hash functions can slow it down sometimes.

Interview Connect

Knowing these differences helps you choose the right data structure and explain your choices clearly in interviews.

Self-Check

"What if the array was sorted? How would that change the time complexity for lookup?"

Practice

1. Which data structure provides the fastest average lookup time for a key-value pair?

easy

A. Stack

B. Array

C. Linked List

D. Hash Map

Solution

1. Step 1: Understand lookup times for each data structure

   Hash Map uses hashing to find keys quickly, averaging O(1) time. Arrays require searching or indexing, O(1) if index known but O(n) if searching by value. Linked Lists require traversal, O(n) time.

2. Step 2: Compare average lookup times

   Hash Map is fastest on average for key-value lookup due to direct hashing. Arrays and Linked Lists are slower for key-based lookup.

3. Final Answer:

   Hash Map -> Option D

4. Quick Check:

   Fastest lookup = Hash Map [OK]

Hint: Hash Map uses hashing for O(1) average lookup [OK]

Common Mistakes:

• Confusing array index lookup with key lookup
• Assuming linked list lookup is fast
• Ignoring average vs worst-case lookup times

2. Which of the following is the correct way to declare a HashMap (Dictionary) in C#?

easy

A. var map = new Dictionary();

B. var map = new HashMap();

C. var map = new Map();

D. var map = new Array();

Solution

1. Step 1: Recall C# syntax for dictionary declaration

   C# uses Dictionary class for hash maps, declared as new Dictionary().

2. Step 2: Check each option for correctness

   var map = new Dictionary(); uses Dictionary correctly. Options A and C use non-existent classes HashMap and Map. var map = new Array(); uses Array incorrectly.

3. Final Answer:

   var map = new Dictionary(); -> Option A

4. Quick Check:

   C# Dictionary syntax = var map = new Dictionary(); [OK]

Hint: Use Dictionary for hash maps in C# [OK]

Common Mistakes:

• Using Java or other language classes like HashMap
• Confusing Map with Dictionary
• Trying to use Array for key-value pairs

3. What will be the output of the following C# code?

var list = new LinkedList<int>();
list.AddLast(10);
list.AddLast(20);
list.AddLast(30);

bool found = list.Contains(20);
Console.WriteLine(found);

medium

A. 20

B. True

C. False

D. Compilation Error

Solution

1. Step 1: Understand LinkedList operations

   Elements 10, 20, 30 are added to the linked list. The Contains method checks if 20 exists in the list.

2. Step 2: Evaluate the Contains method result

   Since 20 was added, Contains(20) returns true. Console.WriteLine prints True.

3. Final Answer:

   True -> Option B

4. Quick Check:

   list.Contains(20) = True [OK]

Hint: LinkedList.Contains returns true if element exists [OK]

Common Mistakes:

• Assuming Contains returns the element instead of bool
• Confusing AddLast with AddFirst
• Expecting output 20 instead of True

4. Identify the error in this C# code snippet that tries to find a value in an array:

int[] arr = {1, 2, 3, 4};
if(arr.Contains(5))
{
    Console.WriteLine("Found");
}

medium

A. Contains method returns index, not bool

B. Array does not have Contains method

C. Contains method requires using System.Linq namespace

D. Array must be converted to List before Contains

Solution

1. Step 1: Check if Array.Contains is available by default

   Array itself does not have Contains method unless System.Linq is used which adds extension methods.

2. Step 2: Identify missing namespace

   Without 'using System.Linq;', Contains method call causes a compile error. Adding the namespace fixes it.

3. Final Answer:

   Contains method requires using System.Linq namespace -> Option C

4. Quick Check:

   Missing System.Linq causes Contains error [OK]

Hint: Add 'using System.Linq;' to use Contains on arrays [OK]

Common Mistakes:

• Thinking Array has Contains by default
• Confusing Contains return type
• Trying to convert array unnecessarily

5. You need to store a large collection of unique user IDs and quickly check if a user ID exists. Which data structure is best and why?

Choose the best option:

hard

A. Hash Map (Dictionary), because it provides O(1) average lookup time for existence checks

B. Linked List, because it allows easy insertion and deletion

C. Stack, because it supports fast push and pop operations

D. Array, because it uses less memory and supports fast index lookup

Solution

1. Step 1: Analyze requirements for storing unique IDs and fast existence check

   We need to quickly check if a user ID exists, so lookup speed is critical. Also, uniqueness is important.

2. Step 2: Compare data structures for lookup efficiency and uniqueness

   Array requires linear search for existence, O(n). Linked List also O(n). Stack is LIFO, not suitable for lookup. Hash Map (Dictionary) offers O(1) average lookup and can enforce uniqueness by keys.

3. Final Answer:

   Hash Map (Dictionary), because it provides O(1) average lookup time for existence checks -> Option A

4. Quick Check:

   Fast unique lookup = Hash Map [OK]

Hint: Use Hash Map for fast unique key existence checks [OK]

Common Mistakes:

• Choosing array for fast lookup without key index
• Confusing insertion speed with lookup speed
• Selecting stack which is not for lookup