Kth Largest Element Using Max Heap in DSA Javascript - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a Max Heap?

A Max Heap is a special tree-based data structure where the parent node is always greater than or equal to its child nodes. This means the largest element is always at the root.

beginner

Why use a Max Heap to find the Kth largest element?

Because the largest element is always at the root, we can remove the largest element K-1 times to reach the Kth largest element efficiently.

intermediate

What is the time complexity of finding the Kth largest element using a Max Heap?

Building the Max Heap takes O(n) time, and removing the max element K times takes O(k log n). So overall, it is O(n + k log n).

beginner

What happens when you remove the root from a Max Heap?

The root (largest element) is removed, the last element moves to the root, and then the heap is adjusted (heapified) to maintain the Max Heap property.

beginner

Explain the steps to find the Kth largest element using a Max Heap.

1. Build a Max Heap from the array.
2. Remove the root (largest element) K-1 times.
3. The root now is the Kth largest element.
4. Return this root value.

What is the root of a Max Heap?

A A random element

B The largest element

C The middle element

D The smallest element

In a Max Heap, the root is always the largest element.

How many times do you remove the root to find the 3rd largest element using a Max Heap?

A 2 times

B 1 time

C 3 times

D 4 times

You remove the root K-1 times, so for the 3rd largest element, remove 2 times.

What is the time complexity to build a Max Heap from an array of size n?

A O(log n)

B O(n log n)

C O(n)

D O(k log n)

Building a Max Heap from an array takes O(n) time.

After removing the root from a Max Heap, what operation is needed to restore the heap property?

A Heapify

B Sorting the array

C Reversing the array

D No operation needed

Heapify is used to restore the Max Heap property after removal.

Which data structure is best suited to efficiently find the Kth largest element?

A Stack

B Queue

C Linked List

D Max Heap

Max Heap allows quick access to the largest elements, making it efficient for this task.

Describe how to find the Kth largest element using a Max Heap step-by-step.

Think about how the largest elements are removed one by one.

Explain why a Max Heap is preferred over sorting the entire array to find the Kth largest element.

Consider the cost of sorting vs partial extraction.

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 max element k times

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

C. Use a min heap to store all elements and pop k times

D. Reverse the array and pick the kth element

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 largest element.

2. Step 2: Extract max k times to get the kth largest

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

3. Final Answer:

   Build 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 find kth largest [OK]

Common Mistakes:

• Using min heap instead of max heap
• Sorting and picking wrong index
• Extracting fewer or more than k times

2. Which of the following is the correct way to create a max heap from an array arr in JavaScript using a custom heap class?

easy

A. const maxHeap = new MaxHeap(arr); maxHeap.heapify();

B. const maxHeap = new MaxHeap(); maxHeap.insert(arr);

C. const maxHeap = new MaxHeap(); maxHeap.build(arr);

D. const maxHeap = new MaxHeap(arr); maxHeap.buildHeap();

Solution

1. Step 1: Recognize typical max heap initialization

   Usually, a max heap class accepts an array and has a method like buildHeap() to create the heap structure.

2. Step 2: Identify correct method call

   buildHeap() is the standard method to convert the array into a max heap, so calling it after initialization is correct.

3. Final Answer:

   const maxHeap = new MaxHeap(arr); maxHeap.buildHeap(); -> Option D

4. Quick Check:

   buildHeap() builds max heap from array [OK]

Hint: Use buildHeap() after passing array to MaxHeap constructor [OK]

Common Mistakes:

• Calling insert with whole array instead of single elements
• Using wrong method names like heapify or build
• Not calling any method to build the heap

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

class MaxHeap {
  constructor(arr) {
    this.heap = arr;
    this.buildHeap();
  }
  buildHeap() {
    for (let i = Math.floor(this.heap.length / 2) - 1; i >= 0; i--) {
      this.heapify(i);
    }
  }
  heapify(i) {
    let largest = i;
    let left = 2 * i + 1;
    let right = 2 * i + 2;
    if (left < this.heap.length && this.heap[left] > this.heap[largest]) largest = left;
    if (right < this.heap.length && this.heap[right] > this.heap[largest]) largest = right;
    if (largest !== i) {
      [this.heap[i], this.heap[largest]] = [this.heap[largest], this.heap[i]];
      this.heapify(largest);
    }
  }
  extractMax() {
    if (this.heap.length === 0) return null;
    const max = this.heap[0];
    this.heap[0] = this.heap.pop();
    this.heapify(0);
    return max;
  }
}

const arr = [3, 2, 1, 5, 6, 4];
const maxHeap = new MaxHeap(arr);
let kthLargest;
for (let i = 0; i < 2; i++) {
  kthLargest = maxHeap.extractMax();
}
console.log(kthLargest);

medium

A. 6

B. 5

C. 4

D. 3

Solution

1. Step 1: Build max heap from array

   Array [3,2,1,5,6,4] becomes max heap with root 6 after buildHeap.

2. Step 2: Extract max twice

   First extractMax returns 6, second extractMax returns 5, so kthLargest after loop is 5.

3. Final Answer:

   5 -> Option B

4. Quick Check:

   2nd largest element = 5 [OK]

Hint: Extract max twice from max heap to get 2nd largest [OK]

Common Mistakes:

• Assuming heap root changes incorrectly after extraction
• Confusing 1st largest with 2nd largest
• Not updating heap after extraction

4. Identify the bug in the following code that tries to find the 3rd largest element using a max heap:

class MaxHeap {
  constructor(arr) {
    this.heap = arr;
    this.buildHeap();
  }
  buildHeap() {
    for (let i = 0; i < this.heap.length / 2; i++) {
      this.heapify(i);
    }
  }
  heapify(i) {
    let largest = i;
    let left = 2 * i + 1;
    let right = 2 * i + 2;
    if (left < this.heap.length && this.heap[left] > this.heap[largest]) largest = left;
    if (right < this.heap.length && this.heap[right] > this.heap[largest]) largest = right;
    if (largest !== i) {
      [this.heap[i], this.heap[largest]] = [this.heap[largest], this.heap[i]];
      this.heapify(largest);
    }
  }
  extractMax() {
    if (this.heap.length === 0) return null;
    const max = this.heap[0];
    this.heap[0] = this.heap.pop();
    this.heapify(0);
    return max;
  }
}

const arr = [7, 10, 4, 3, 20, 15];
const maxHeap = new MaxHeap(arr);
let kthLargest;
for (let i = 0; i < 3; i++) {
  kthLargest = maxHeap.extractMax();
}
console.log(kthLargest);

medium

A. The buildHeap loop should run backwards from middle to 0

B. extractMax should not call heapify after popping

C. heapify should swap with smallest child instead of largest

D. The array should be sorted before building the heap

Solution

1. Step 1: Analyze buildHeap loop direction

   Heap building requires heapify calls from last parent to root, so loop must run backwards from middle to 0.

2. Step 2: Identify incorrect loop direction

   Current loop runs forwards, which does not correctly heapify the tree, causing incorrect heap structure.

3. Final Answer:

   The buildHeap loop should run backwards from middle to 0 -> Option A

4. Quick Check:

   buildHeap loop direction = backwards [OK]

Hint: buildHeap loop must run backwards from middle to root [OK]

Common Mistakes:

• Running buildHeap loop forwards
• Not calling heapify after extractMax
• Swapping with wrong child in heapify

5. Given an array arr = [12, 3, 5, 7, 19, 0, 4], write a JavaScript function using a max heap to find the 4th largest element. What is the output of your function?

hard

A. 4

B. 5

C. 7

D. 3

Solution

1. Step 1: Build max heap from array

   Array becomes max heap with root 19 after heapify.

2. Step 2: Extract max 4 times

   Extracted elements in order: 19, 12, 7, 5. The 4th largest is 7.

3. Final Answer:

   7 -> Option C

4. Quick Check:

   4th largest element = 7 [OK]

Hint: Extract max k times; last extracted is kth largest [OK]

Common Mistakes:

• Extracting fewer times than k
• Confusing 3rd largest with 4th largest
• Not rebuilding heap after extraction