Hash Map vs Array vs Linked List for Lookup in DSA Python - 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 a value 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 each data structure.

def lookup_array(arr, target):
    for item in arr:
        if item == target:
            return True
    return False


def lookup_linked_list(head, target):
    current = head
    while current:
        if current.value == target:
            return True
        current = current.next
    return False


def lookup_hash_map(hmap, target):
    return target in hmap

This code shows how to find a value in an array, a linked list, and a hash map.

Identify Repeating Operations

Look at what repeats when searching:

• Array and Linked List: Loop through each item one by one.
• Hash Map: Directly check if the key exists using a special method.
• Primary operation: Checking each element one by one for array and linked list; direct key check for hash map.
• How many times: Up to all elements for array and linked list; usually once for hash map.

How Execution Grows With Input

As the number of items grows, the time to find a value 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 grow linearly with input 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 looking up in an array or linked list takes longer as data grows, but hash map lookup stays fast.

Common Mistake

[X] Wrong: "All data structures find values equally fast."

[OK] Correct: Arrays and linked lists check items one by one, so they get slower with more data. Hash maps use a special way to jump directly to the value.

Interview Connect

Knowing these differences helps you pick the right data structure for fast lookups, a key skill in many coding challenges and real projects.

Self-Check

"What if the hash map has many collisions? How would that affect lookup time complexity?"

Practice

1. Which data structure provides the fastest average lookup time for finding an element by key?

easy

A. Hash Map

B. Array

C. Linked List

D. Stack

Solution

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

   Hash Map uses a hash function to find keys quickly, usually in constant time O(1). Arrays require scanning or index access, O(1) if index known but O(n) if searching by value. Linked Lists require scanning nodes, O(n).

2. Step 2: Compare average lookup times

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

3. Final Answer:

   Hash Map -> Option A

4. Quick Check:

   Fastest lookup = Hash Map [OK]

Hint: Hash Map uses keys for O(1) lookup, arrays and lists do not [OK]

Common Mistakes:

• Confusing array index access with value lookup
• Thinking linked list lookup is fast
• Assuming stack is a lookup structure

2. Which of the following is the correct syntax to create an empty hash map (dictionary) in Python?

easy

A. hash_map = {}

B. hash_map = ()

C. hash_map = []

D. hash_map = set()

Solution

1. Step 1: Recall Python syntax for empty data structures

   Empty list uses [], empty tuple uses (), empty dictionary uses {}, and empty set uses set().

2. Step 2: Identify the hash map syntax

   Hash map in Python is a dictionary, created with {}.

3. Final Answer:

   hash_map = {} -> Option A

4. Quick Check:

   Empty dict = {} [OK]

Hint: Use curly braces {} for empty dictionary in Python [OK]

Common Mistakes:

• Using [] which creates a list, not a dictionary
• Using () which creates a tuple
• Using set() which creates a set, not a dictionary

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

arr = [10, 20, 30, 40]
lookup = {val: idx for idx, val in enumerate(arr)}
print(lookup.get(30))
print(lookup.get(50, -1))

medium

A. 30\n50

B. 3\n-1

C. 2\n-1

D. null\n-1

Solution

1. Step 1: Understand dictionary comprehension and get method

   The dictionary 'lookup' maps values to their indices: {10:0, 20:1, 30:2, 40:3}. lookup.get(30) returns the index for 30, which is 2. lookup.get(50, -1) looks for 50, not found, returns default -1.

2. Step 2: Determine printed output

   First print outputs 2. Second print outputs -1.

3. Final Answer:

   2 -1 -> Option C

4. Quick Check:

   lookup[30] = 2, missing key returns -1 [OK]

Hint: Dictionary get returns default if key missing [OK]

Common Mistakes:

• Confusing keys and values in dictionary
• Expecting get to raise error if key missing
• Mixing index and value in output

4. The following code tries to find if a value exists in a linked list. What is the bug?

class Node:
    def __init__(self, val):
        self.val = val
        self.next = None

def find(head, target):
    current = head
    while current.next is not None:
        if current.val == target:
            return True
        current = current.next
    return False

medium

A. The function should use recursion instead of a loop

B. The loop condition should be 'while current is not None' to check last node

C. The Node class is missing a previous pointer

D. The function should return false inside the loop

Solution

1. Step 1: Analyze loop condition in linked list traversal

   The loop uses 'while current.next is not None', so it stops before last node. This means the last node's value is never checked.

2. Step 2: Correct loop condition to include last node

   Changing to 'while current is not None' ensures all nodes, including last, are checked for target value.

3. Final Answer:

   The loop condition should be 'while current is not None' to check last node -> Option B

4. Quick Check:

   Loop must check all nodes including last [OK]

Hint: Check loop condition includes last node (current is not None) [OK]

Common Mistakes:

• Stopping loop early missing last node
• Adding unnecessary previous pointer
• Thinking recursion is required

5. You have a large dataset of unique user IDs and want to check membership quickly. Which data structure is best and why? A) Array because it stores elements sequentially B) Linked List because it allows easy insertion C) Hash Map because it provides average O(1) lookup D) Stack because it supports last-in-first-out access

hard

A. Array because it stores elements sequentially

B. Linked List because it allows easy insertion

C. Stack because it supports last-in-first-out access

D. Hash Map because it provides average O(1) lookup

Solution

1. Step 1: Understand lookup needs for large dataset

   Checking membership means quickly finding if an element exists. Arrays and linked lists require scanning, O(n) time. Stacks are not designed for membership lookup.

2. Step 2: Identify best data structure for fast membership

   Hash Map uses hashing to find elements in average O(1) time, ideal for large datasets and membership checks.

3. Final Answer:

   Hash Map because it provides average O(1) lookup -> Option D

4. Quick Check:

   Fast membership = Hash Map [OK]

Hint: Use hash map for fast membership checks in large data [OK]

Common Mistakes:

• Choosing array or list for fast lookup
• Confusing insertion speed with lookup speed
• Thinking stack supports membership lookup