Kth Smallest Element Using Min Heap in DSA Java - Time & Space Complexity

Time Complexity: Kth Smallest Element Using Min Heap

O(n log n)

Understanding Time Complexity

We want to know how the time needed to find the kth smallest element grows as the input size changes.

Specifically, how the operations scale when using a min heap to solve this problem.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

import java.util.PriorityQueue;

public int kthSmallest(int[] nums, int k) {
    PriorityQueue<Integer> minHeap = new PriorityQueue<>();
    for (int num : nums) {
        minHeap.add(num);
    }
    for (int i = 1; i < k; i++) {
        minHeap.poll();
    }
    return minHeap.peek();
}
    

This code builds a min heap from the array, then removes the smallest elements k-1 times to find the kth smallest.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Adding all elements to the min heap and removing k-1 elements.
• How many times: Adding happens n times (once per element), removing happens k-1 times.

How Execution Grows With Input

Adding each element to the heap takes a small amount of time, repeated n times. Removing elements happens k-1 times. Both depend on the heap size.

Input Size (n)	Approx. Operations
10	About 10 adds + up to 9 removes
100	About 100 adds + up to 99 removes
1000	About 1000 adds + up to 999 removes

Pattern observation: Operations grow roughly linearly with n and k, but each add or remove takes time related to heap height, which grows slowly with n.

Final Time Complexity

Time Complexity: O(n log n)

This means the time grows a bit faster than just the number of elements because each heap operation takes time related to the heap's height.

Common Mistake

[X] Wrong: "Adding all elements to the heap is just O(n) because it's one loop."

[OK] Correct: Each add operation takes time depending on the heap size, so adding n elements is actually O(n log n), not just O(n).

Interview Connect

Understanding how heap operations affect time helps you explain your solution clearly and shows you know how data structures impact performance.

Self-Check

"What if we used a max heap of size k instead of a min heap of size n? How would the time complexity change?"

Practice

1. What does the kth smallest element mean in a list of numbers?

easy

A. The element that is the kth in ascending order

B. The largest element in the list

C. The element that appears kth from the end

D. The element with the kth highest frequency

Solution

1. Step 1: Understand the meaning of kth smallest

   The kth smallest element is the element that would appear at position k if the list was sorted in ascending order.

2. Step 2: Compare with other options

   Options B, C, and D describe different concepts: largest element, kth from end, and frequency-based element, which are not the kth smallest.

3. Final Answer:

   The element that is the kth in ascending order -> Option A

4. Quick Check:

   kth smallest = kth element in sorted list [OK]

Hint: Sort the list; kth smallest is element at index k-1 [OK]

Common Mistakes:

• Confusing kth smallest with kth largest
• Thinking kth smallest means kth from the end
• Mixing element frequency with position

2. Which Java code snippet correctly creates a min heap using PriorityQueue to find the kth smallest element?

easy

A. PriorityQueue<Integer> minHeap = new PriorityQueue<>(Comparator.reverseOrder());

B. PriorityQueue<Integer> minHeap = new PriorityQueue<>(Collections.reverseOrder());

C. PriorityQueue<Integer> minHeap = new PriorityQueue<>(Collections.reverseOrder(), k);

D. PriorityQueue<Integer> minHeap = new PriorityQueue<>();

Solution

1. Step 1: Identify min heap creation syntax

   In Java, new PriorityQueue<>() creates a min heap by default.

2. Step 2: Analyze other options

   Options B, C, and D create max heaps using reverse order comparators.

3. Final Answer:

   PriorityQueue<Integer> minHeap = new PriorityQueue<>(); -> Option D

4. Quick Check:

   Default PriorityQueue = min heap [OK]

Hint: Use PriorityQueue without comparator for min heap [OK]

Common Mistakes:

• Using reverseOrder() creates max heap, not min heap
• Confusing initial capacity with heap type
• Not importing java.util.PriorityQueue

3. What is the output of the following Java code snippet?

int[] arr = {7, 10, 4, 3, 20, 15};
int k = 3;
PriorityQueue<Integer> minHeap = new PriorityQueue<>();
for (int num : arr) {
    minHeap.add(num);
}
int result = 0;
for (int i = 0; i < k; i++) {
    result = minHeap.poll();
}
System.out.println(result);

medium

A. 10

B. 4

C. 7

D. 3

Solution

1. Step 1: Add all elements to min heap

   Elements added: 7, 10, 4, 3, 20, 15. Min heap orders them internally as 3,4,7,10,15,20.

2. Step 2: Poll k=3 times from min heap

   First poll: 3, second poll: 4, third poll: 7. The variable result holds the last polled value, 7.

3. Final Answer:

   7 -> Option C

4. Quick Check:

   3rd smallest element = 7 [OK]

Hint: Poll k times from min heap; last polled is kth smallest [OK]

Common Mistakes:

• Returning first polled element instead of kth
• Confusing min heap order with insertion order
• Off-by-one error in loop count

4. Identify the error in this Java code to find kth smallest element using min heap:

int kthSmallest(int[] arr, int k) {
    PriorityQueue<Integer> minHeap = new PriorityQueue<>();
    for (int i = 0; i <= arr.length; i++) {
        minHeap.add(arr[i]);
    }
    int result = 0;
    for (int i = 0; i < k; i++) {
        result = minHeap.poll();
    }
    return result;
}

medium

A. Loop condition should be i < arr.length, not i <= arr.length

B. PriorityQueue should be max heap, not min heap

C. Poll loop should run k+1 times

D. Return statement should return minHeap.peek()

Solution

1. Step 1: Check array loop bounds

   The for loop uses i <= arr.length, which causes ArrayIndexOutOfBoundsException because valid indices are 0 to arr.length-1.

2. Step 2: Verify other parts

   Min heap is correct for kth smallest. Poll loop runs k times correctly. Return statement returns last polled element, which is correct.

3. Final Answer:

   Loop condition should be i < arr.length, not i <= arr.length -> Option A

4. Quick Check:

   Array index out of bounds due to loop condition [OK]

Hint: Use i < arr.length to avoid index errors [OK]

Common Mistakes:

• Using <= instead of < in array loops
• Changing heap type unnecessarily
• Polling wrong number of times

5. Given a large array with millions of elements, which approach is most efficient to find the kth smallest element?

hard

A. Add all elements to a min heap and poll k times

B. Add first k elements to a max heap, then for each remaining element, replace root if smaller

C. Sort the entire array and pick element at index k-1

D. Use a hash map to count frequencies and pick kth smallest key

Solution

1. Step 1: Understand efficiency of adding all elements to min heap

   Adding all millions of elements to a min heap and polling k times is O(n + k log n), which is costly for large n.

2. Step 2: Use max heap of size k for better efficiency

   Adding first k elements to a max heap keeps track of k smallest seen so far. For each new element, if smaller than max heap root, replace root. This is O(n log k), much better for large n.

3. Step 3: Compare other options

   Sorting entire array is O(n log n), slower than max heap approach. Hash map frequency counting is not suitable for kth smallest element.

4. Final Answer:

   Add first k elements to a max heap, then for each remaining element, replace root if smaller -> Option B

5. Quick Check:

   Max heap of size k = efficient kth smallest [OK]

Hint: Use max heap of size k for large arrays [OK]

Common Mistakes:

• Using min heap with all elements for large data
• Sorting entire array unnecessarily
• Confusing frequency counting with order statistics