Hash Map vs Array vs Linked List for Lookup in DSA Java - 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 complexity of looking up a value in these data structures.

// Lookup in Array
for (int i = 0; i < arr.length; i++) {
  if (arr[i] == target) {
    return i;
  }
}

// Lookup in Linked List
Node current = head;
while (current != null) {
  if (current.value == target) {
    return current;
  }
  current = current.next;
}

// Lookup in Hash Map
if (map.containsKey(targetKey)) {
  return map.get(targetKey);
}
    

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

Identify Repeating Operations

Look for loops or repeated steps that take time.

• Primary operation in Array: Loop through each element until found.
• Primary operation in Linked List: Traverse nodes one by one until found.
• Primary operation in Hash Map: Directly access value using a key (no loop).
• How many times: Array and Linked List may check many elements; Hash Map does one main step.

How Execution Grows With Input

As the data size grows, how does the time to find a value change?

Input Size (n)	Array & Linked List Checks	Hash Map Steps
10	Up to 10 checks	1 step
100	Up to 100 checks	1 step
1000	Up to 1000 checks	1 step

Pattern observation: Array and Linked List time grows linearly with size; Hash Map time stays almost constant.

Final Time Complexity

Time Complexity: O(n) for Array and Linked List, O(1) for Hash Map

Array and Linked List take longer as data grows; Hash Map finds values quickly regardless of size.

Common Mistake

[X] Wrong: "Hash Map always takes longer because it uses hashing."

[OK] Correct: Hash Map uses a clever way to jump directly to the value, so it usually finds it very fast.

Interview Connect

Knowing how different data structures handle lookup helps you choose the right one and explain your choices clearly.

Self-Check

"What if the Hash Map has many collisions? How would that affect the lookup time complexity?"

Practice

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

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 hashing to find keys quickly, usually in constant time O(1). Arrays require searching by index or linear search for values, O(1) for index but O(n) for value lookup. Linked Lists require linear search O(n).

2. Step 2: Compare average lookup times

   Hash Map average lookup is O(1), Array lookup by index is O(1) but by value is O(n), Linked List lookup is O(n).

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 lookup with value lookup
• Assuming linked list lookup is fast
• Thinking stack is for key-value lookup

2. Which of the following is the correct way to declare a HashMap in Java for storing Integer keys and String values?

easy

A. HashMap map = new HashMap();

B. HashMap map = new HashMap<>();

C. HashMap map = new HashMap();

D. HashMap map = new HashMap<>();

Solution

1. Step 1: Check generic types in HashMap declaration

   Java uses wrapper classes like Integer, not primitive int, for generics. So HashMap is invalid.

2. Step 2: Check constructor syntax

   Using diamond operator <> is correct for type inference. HashMap map = new HashMap<>(); is valid and preferred.

3. Final Answer:

   HashMap map = new HashMap<>(); -> Option D

4. Quick Check:

   Correct generic syntax = HashMap map = new HashMap<>(); [OK]

Hint: Use wrapper classes and diamond operator for HashMap declaration [OK]

Common Mistakes:

• Using primitive types like int in generics
• Omitting diamond operator causing raw type warning
• Swapping key and value types in constructor

3. What will be the output of the following Java code snippet?

import java.util.*;
public class Test {
  public static void main(String[] args) {
    List<Integer> list = Arrays.asList(10, 20, 30);
    Map map = new HashMap<>();
    for (int i = 0; i < list.size(); i++) {
      map.put(list.get(i), "Value" + i);
    }
    System.out.println(map.get(20));
  }
}

medium

A. Value0

B. 20

C. Value1

D. null

Solution

1. Step 1: Understand the loop and map population

   The loop runs i from 0 to 2. For each i, map puts key list.get(i) and value "Value" + i. So keys 10, 20, 30 map to "Value0", "Value1", "Value2" respectively.

2. Step 2: Check the output of map.get(20)

   Key 20 maps to "Value1" so printing map.get(20) outputs "Value1".

3. Final Answer:

   Value1 -> Option C

4. Quick Check:

   map.get(20) = Value1 [OK]

Hint: Map keys match list values; index i forms value string [OK]

Common Mistakes:

• Confusing key with value in map.get()
• Assuming map stores values in insertion order
• Expecting numeric output instead of string

4. Identify the error in the following Java code snippet that tries to find if a value exists in a LinkedList:

LinkedList<String> list = new LinkedList<>();
list.add("apple");
list.add("banana");
if (list.contains("orange")) {
  System.out.println("Found orange");
} else {
  System.out.println("Orange not found");
}

medium

A. No error; code works correctly

B. LinkedList does not have contains() method

C. Must use list.search("orange") instead of contains()

D. Contains method only works for integers

Solution

1. Step 1: Check LinkedList methods

   Java's LinkedList class inherits from Collection and has a contains() method to check if an element exists.

2. Step 2: Verify code logic

   The code adds "apple" and "banana" to list, then checks if "orange" is contained. Since "orange" is not in list, it prints "Orange not found". This is correct behavior.

3. Final Answer:

   No error; code works correctly -> Option A

4. Quick Check:

   LinkedList.contains() works as expected [OK]

Hint: LinkedList inherits contains() from Collection interface [OK]

Common Mistakes:

• Thinking contains() is not available for LinkedList
• Using non-existent search() method
• Assuming contains() only works for integers

5. You need to store a large dataset of user IDs (integers) and their names (strings) for fast lookup by user ID. Which data structure is best and why? Choose the best option considering lookup speed, memory, and insertion time.

hard

A. Array, because it provides O(1) lookup by index

B. Hash Map, because it provides average O(1) lookup by key

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

D. Binary Search Tree, because it keeps data sorted

Solution

1. Step 1: Analyze lookup requirements

   We need fast lookup by user ID (key). Array lookup by index is O(1), but user IDs are not guaranteed to be continuous indices.

2. Step 2: Compare data structures for key-based lookup

   Linked List lookup is O(n), too slow. Binary Search Tree lookup is O(log n), slower than Hash Map average O(1). Hash Map stores key-value pairs with fast average lookup.

3. Step 3: Consider insertion and memory

   Hash Map has good insertion time and reasonable memory overhead. Array wastes memory if IDs are sparse. BST keeps data sorted but slower lookup.

4. Final Answer:

   Hash Map, because it provides average O(1) lookup by key -> Option B

5. Quick Check:

   Best for fast key lookup = Hash Map [OK]

Hint: Use Hash Map for fast key-based lookup, not arrays or lists [OK]

Common Mistakes:

• Choosing array assuming user IDs are continuous
• Ignoring lookup time differences
• Preferring BST for speed over Hash Map