Why Hash Map Exists and What Problem It Solves in DSA Java - Performance Analysis

Time Complexity: Why Hash Map Exists and What Problem It Solves

O(n)

Understanding Time Complexity

We want to understand why hash maps are used and how they help us find data quickly.

What question are we trying to answer? How fast can we find or store information?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

// Simple search in an array
public boolean contains(int[] arr, int target) {
    for (int i = 0; i < arr.length; i++) {
        if (arr[i] == target) {
            return true;
        }
    }
    return false;
}
    

This code checks if a number exists in an array by looking at each item one by one.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Checking each element in the array one by one.
• How many times: Up to n times, where n is the number of elements in the array.

How Execution Grows With Input

As the array gets bigger, the time to find an item grows roughly in a straight line.

Input Size (n)	Approx. Operations
10	Up to 10 checks
100	Up to 100 checks
1000	Up to 1000 checks

Pattern observation: Doubling the input size roughly doubles the work needed.

Final Time Complexity

Time Complexity: O(n)

This means the time to find an item grows directly with the number of items.

Common Mistake

[X] Wrong: "Searching in any collection is always fast and takes the same time."

[OK] Correct: Some collections like arrays need to check many items one by one, so time grows with size.

Interview Connect

Knowing why hash maps exist helps you explain how to find data quickly in real programs.

Self-Check

"What if we used a hash map instead of an array? How would the time to find an item change?"

Practice

1. Why do we use a HashMap in Java instead of a simple array when we want to store key-value pairs?

easy

A. Because arrays use more memory than HashMap.

B. Because HashMap allows fast lookup of values by keys.

C. Because HashMap automatically sorts the keys.

D. Because arrays can only store numbers, not keys and values.

Solution

1. Step 1: Understand the limitation of arrays for key-value storage

   Arrays store values by index, not by custom keys, so they can't quickly find a value by a key.

2. Step 2: Recognize the advantage of HashMap

   HashMap stores data as key-value pairs and uses hashing to find values quickly by keys.

3. Final Answer:

   Because HashMap allows fast lookup of values by keys. -> Option B

4. Quick Check:

   Fast key-based lookup = Because HashMap allows fast lookup of values by keys. [OK]

Hint: HashMap = fast key-value lookup, arrays = index-based [OK]

Common Mistakes:

• Thinking arrays can store key-value pairs directly
• Believing HashMap sorts keys automatically
• Confusing memory usage between arrays and HashMaps

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

easy

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

B. HashMap map = new HashMap();

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

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

Solution

1. Step 1: Identify correct generic syntax for HashMap declaration

   The correct syntax uses angle brackets with key and value types on both sides or diamond operator on the right side.

2. Step 2: Check each option for syntax correctness and type order

   HashMap map = new HashMap<>(); correctly declares a HashMap with String keys and Integer values using diamond operator. Others have wrong order or missing types.

3. Final Answer:

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

4. Quick Check:

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

Hint: Use diamond operator <> with correct key-value types [OK]

Common Mistakes:

• Swapping key and value types
• Omitting generic types on right side
• Using raw types without generics

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

import java.util.HashMap;
public class Test {
  public static void main(String[] args) {
    HashMap map = new HashMap<>();
    map.put("apple", 10);
    map.put("banana", 20);
    map.put("apple", 30);
    System.out.println(map.get("apple"));
  }
}

medium

A. 10

B. null

C. 20

D. 30

Solution

1. Step 1: Understand how put works in HashMap with duplicate keys

   When a key already exists, put replaces the old value with the new one.

2. Step 2: Trace the code for key "apple"

   First, "apple" is set to 10, then replaced by 30. So map.get("apple") returns 30.

3. Final Answer:

   30 -> Option D

4. Quick Check:

   Last value for key "apple" = 30 [OK]

Hint: Last put value for a key overwrites previous [OK]

Common Mistakes:

• Assuming first value stays for duplicate keys
• Expecting null for existing keys
• Confusing values of different keys

4. The following code tries to check if a key exists in a HashMap and print its value. What is wrong?

HashMap map = new HashMap<>();
map.put("x", 5);
if (map.containsKey("y")) {
  System.out.println(map.get("y"));
} else {
  System.out.println("Key not found");
}

medium

A. The code throws NullPointerException when key is missing.

B. Using containsKey is wrong; should use get only.

C. No error; code works correctly.

D. The code should check for null instead of using containsKey.

Solution

1. Step 1: Understand containsKey usage

   containsKey safely checks if a key exists without throwing errors.

2. Step 2: Check code behavior for missing key "y"

   Since "y" is missing, containsKey returns false and prints "Key not found" without error.

3. Final Answer:

   No error; code works correctly. -> Option C

4. Quick Check:

   Using containsKey prevents errors = No error; code works correctly. [OK]

Hint: Use containsKey before get to avoid null issues [OK]

Common Mistakes:

• Expecting NullPointerException on missing key
• Using get without checking key existence
• Thinking containsKey is unnecessary

5. You want to count how many times each word appears in a list of words using a HashMap. Which approach correctly solves this problem?

hard

A. Use a HashMap<String, Integer>, for each word check if it exists; if yes, increment count; else, add with count 1.

B. Use a HashMap<Integer, String> and store counts as keys and words as values.

C. Use an array to store counts and loop through words without a map.

D. Use a HashMap<String, String> and store words as both keys and values.

Solution

1. Step 1: Identify the correct key-value types for counting words

   Keys should be words (String), values should be counts (Integer).

2. Step 2: Understand the counting logic using HashMap

   For each word, check if it exists in map; if yes, increment count; else add with count 1.

3. Final Answer:

   Use a HashMap, increment counts per word. -> Option A

4. Quick Check:

   Word count needs String keys and Integer values [OK]

Hint: Map words to counts; increment existing or add new [OK]

Common Mistakes:

• Swapping key and value types
• Using arrays without keys for counting
• Storing words as values instead of counts