Kth Largest Element Using Max Heap in DSA Go

Mental Model

We use a max heap to keep the largest numbers at the top so we can quickly find the kth largest by removing the largest elements one by one.

Analogy: Imagine a pile of books stacked by size with the biggest on top. To find the kth biggest book, you remove the biggest books from the top until you reach the kth one.

Max Heap Array Representation:
[ 50, 30, 40, 10, 20 ]
Heap Tree:
      50
     /  \
   30    40
  /  \
10   20
↑ root (largest)

Dry Run Walkthrough

Input: array: [20, 10, 40, 30, 50], k=3

Goal: Find the 3rd largest element using a max heap

Step 1: Build max heap from array

[50, 30, 40, 10, 20]

Why: We rearrange the array so the largest element is at the root for easy access

Step 2: Remove the largest element (50) from heap

[40, 30, 20, 10]

Why: Removing the largest element moves us closer to the kth largest

Step 3: Remove the next largest element (40) from heap

[30, 10, 20]

Why: We continue removing largest elements to reach the kth

Step 4: Remove the next largest element (30) from heap

[20, 10]

Why: The 3rd removed element is the 3rd largest in the original array

Result:

Heap after 3 removals: [20, 10]
3rd largest element: 30

Annotated Code

DSA Go

package main

import (
	"container/heap"
	"fmt"
)

// MaxHeap implements heap.Interface for a max heap
type MaxHeap []int

func (h MaxHeap) Len() int           { return len(h) }
func (h MaxHeap) Less(i, j int) bool { return h[i] > h[j] } // max heap
func (h MaxHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *MaxHeap) Push(x interface{}) {
	*h = append(*h, x.(int))
}

func (h *MaxHeap) Pop() interface{} {
	n := len(*h)
	val := (*h)[n-1]
	*h = (*h)[:n-1]
	return val
}

func findKthLargest(nums []int, k int) int {
	h := MaxHeap(nums)
	heap.Init(&h) // build max heap

	var kthLargest int
	for i := 0; i < k; i++ {
		kthLargest = heap.Pop(&h).(int) // remove largest k times
	}
	return kthLargest
}

func main() {
	nums := []int{20, 10, 40, 30, 50}
	k := 3
	result := findKthLargest(nums, k)
	fmt.Printf("%dth largest element: %d\n", k, result)
}

heap.Init(&h) // build max heap

convert array into max heap so largest element is at root

kthLargest = heap.Pop(&h).(int) // remove largest k times

remove the root (largest) element k times to get kth largest

Output

3th largest element: 30

Complexity Analysis

Time: O(n + k log n) because building the heap takes O(n) and each of the k removals takes O(log n)

Space: O(n) because the heap stores all n elements

vs Alternative: Compared to sorting the array O(n log n), this approach is faster when k is small because it avoids full sorting

Edge Cases

k is 1 (find largest element)

Returns the maximum element correctly

DSA Go

for i := 0; i < k; i++ {

k equals length of array (find smallest element)

Returns the smallest element after removing all larger ones

DSA Go

for i := 0; i < k; i++ {

array with duplicate elements

Duplicates are handled normally as heap stores all elements

DSA Go

heap.Init(&h)

When to Use This Pattern

When you need the kth largest or smallest element efficiently, use a heap to avoid full sorting and get the element by repeated removal.

Common Mistakes

Mistake: Using a min heap instead of a max heap without adjusting logic
Fix: Use a max heap or invert comparison so largest elements are on top

Mistake: Not building the heap before popping elements
Fix: Call heap.Init to build the heap before popping

Summary

Finds the kth largest element by building a max heap and removing the largest elements k times.

Use when you want the kth largest element without sorting the entire array.

The key insight is that a max heap keeps the largest element at the root for quick access.

Practice

1. What is the main idea behind finding the kth largest element using a max heap?

easy

A. Build a max heap from the array and extract the maximum element k times.

B. Build a min heap and extract the minimum element k times.

C. Sort the array and pick the kth element from the start.

D. Use a hash map to count frequencies and find the kth largest.

Solution

1. Step 1: Understand max heap property

   A max heap always keeps the largest element at the root, so extracting the root gives the current largest element.

2. Step 2: Extract max k times

   By removing the root k times, the last extracted element is the kth largest.

3. Final Answer:

   Build a max heap and extract max k times -> Option A

4. Quick Check:

   Max heap extraction = kth largest element [OK]

Hint: Extract max from max heap k times to get kth largest [OK]

Common Mistakes:

• Using min heap instead of max heap
• Sorting and picking wrong index
• Confusing kth largest with kth smallest

2. Which of the following Go code snippets correctly creates a max heap from a slice arr using the container/heap package?

easy

A. heap.Init(&arr) // arr is []int

B. heap.Pop(arr) // arr is []int

C. heap.Push(arr, value) // arr is []int

D. heap.Init(&maxHeap) // maxHeap implements heap.Interface with max-heap logic

Solution

1. Step 1: Understand Go heap package usage

   The Go heap package requires a type implementing heap.Interface to define heap behavior (min or max).

2. Step 2: Use a custom maxHeap type

   To create a max heap, define a type with Len, Less (inverted for max), Swap, Push, Pop methods, then call heap.Init(&maxHeap).

3. Final Answer:

   heap.Init(&maxHeap) where maxHeap implements max-heap interface -> Option D

4. Quick Check:

   Custom heap.Interface needed for max heap [OK]

Hint: Use custom type implementing heap.Interface for max heap [OK]

Common Mistakes:

• Calling heap.Init on a plain slice
• Not implementing Less method for max heap
• Using heap.Push/Pop directly on slice

3. What is the output of the following Go code snippet that finds the 3rd largest element using a max heap?

package main

import (
	"container/heap"
	"fmt"
)

type MaxHeap []int

func (h MaxHeap) Len() int           { return len(h) }
func (h MaxHeap) Less(i, j int) bool { return h[i] > h[j] }
func (h MaxHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *MaxHeap) Push(x interface{}) {
	*h = append(*h, x.(int))
}

func (h *MaxHeap) Pop() interface{} {
	n := len(*h)
	x := (*h)[n-1]
	*h = (*h)[:n-1]
	return x
}

func main() {
	arr := []int{4, 1, 7, 3, 8, 5}
	h := MaxHeap(arr)
	heap.Init(&h)

	var kthLargest int
	for i := 0; i < 3; i++ {
		kthLargest = heap.Pop(&h).(int)
	}
	fmt.Println(kthLargest)
}

medium

A. 4

B. 5

C. 7

D. 3

Solution

1. Step 1: Build max heap from array

   Array is [4,1,7,3,8,5]. Max heap root is 8, next largest 7, then 5, etc.

2. Step 2: Pop max 3 times

   First pop: 8, second pop: 7, third pop: 5. The 3rd largest is 5.

3. Final Answer:

   5 -> Option B

4. Quick Check:

   3rd largest element = 5 [OK]

Hint: Pop max heap k times; last popped is kth largest [OK]

Common Mistakes:

• Confusing 3rd largest with 2nd largest
• Not building max heap correctly
• Off-by-one errors in loop

4. Identify the error in this Go code snippet that tries to find the 2nd largest element using a max heap:

package main

import (
	"container/heap"
	"fmt"
)

type MaxHeap []int

func (h MaxHeap) Len() int           { return len(h) }
func (h MaxHeap) Less(i, j int) bool { return h[i] < h[j] }
func (h MaxHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }

func (h *MaxHeap) Push(x interface{}) {
	*h = append(*h, x.(int))
}

func (h *MaxHeap) Pop() interface{} {
	n := len(*h)
	x := (*h)[n-1]
	*h = (*h)[:n-1]
	return x
}

func main() {
	arr := []int{10, 20, 15, 30, 40}
	h := MaxHeap(arr)
	heap.Init(&h)

	heap.Pop(&h)
	secondLargest := heap.Pop(&h).(int)
	fmt.Println(secondLargest)
}

medium

A. Push method does not append correctly.

B. Pop method returns wrong element from the heap.

C. Less method uses < instead of >, so heap is min heap not max heap.

D. heap.Init is called on a slice, not a heap.Interface.

Solution

1. Step 1: Check Less method for heap type

   Less uses < which creates a min heap, but we want a max heap for kth largest.

2. Step 2: Effect on extraction

   Extracting twice from min heap gives 10 and 15, not the largest elements.

3. Final Answer:

   Less method uses < instead of >, making it a min heap -> Option C

4. Quick Check:

   Less method defines heap type [OK]

Hint: Max heap Less must use >, not < [OK]

Common Mistakes:

• Using < in Less for max heap
• Not implementing heap.Interface fully
• Calling heap.Init on plain slice

5. Given a large array of integers, which approach is most efficient to find the 5th largest element using a heap in Go, considering time and space complexity?

hard

A. Build a min heap of size 5 and iterate through array, replacing root if element is larger.

B. Build a max heap of the entire array and pop 5 times.

C. Sort the entire array and pick the 5th largest element.

D. Use a hash map to count frequencies and find the 5th largest.

Solution

1. Step 1: Compare approaches for large arrays

   Building a max heap of entire array is O(n), popping 5 times is O(k log n). Sorting is O(n log n).

2. Step 2: Use min heap of size 5 for efficiency

   Maintaining a min heap of size 5 keeps track of top 5 largest elements in O(n log k) time and O(k) space, which is efficient.

3. Final Answer:

   Use a min heap of size 5 and replace root when larger element found -> Option A

4. Quick Check:

   Min heap size k for kth largest is efficient [OK]

Hint: Use min heap of size k for efficient kth largest in large data [OK]

Common Mistakes:

• Building max heap of entire array wastes space/time
• Sorting entire array is slower for large data
• Using hash map does not help with order