Voozh

VOOZH

URL: https://www.geeksforgeeks.org/tag/max-heap/

⇱ max-heap Archives - GeeksforGeeks

Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

JavaScript9.9K+ articles

Arrays4.2K+ articles

Greedy1.4K+ articles

Arrays257+ articles

Heap177+ articles

priority-queue148+ articles

Greedy Algorithms112+ articles

java-priority-queue41+ articles

Count elements that are greater than at least K elements on its left and right

Last Updated: 23 July 2025

Given an array arr[] of size n (1 = n = 10^5) and a positive integer k, the task is to count all indices i ( 1= i n) in the array such that at least k elements to the lef...read more

Geeks Premier League

Geeks Premier League 2023

Furthest Reachable Tower using Blocks and Ladders

Last Updated: 23 July 2025

Given an array heights[] of size N, where heights[i] is the height of the ith tower. We are standing at the 0th tower with B blocks and L ladders and we have to reach the ...read more

Greedy Algorithms

Reduce Array by replacing pair with their difference

Last Updated: 20 December 2023

You are given an array of positive integers. You can perform the following operations on the array any number of times:Select the two largest elements in the array, suppos...read more

java-priority-queue

Heap data structure implementation in swift

Last Updated: 28 April 2025

A heap is a complete binary tree where each node satisfies the heap property. The heap property is different for different types of heaps but, in general, it means that ea...read more

Find the minimised number using given operations

Last Updated: 23 July 2025

Given an array arr[] of n elements. In one operation you can pick two indices i and j, such that arr[i] ≥ arr[j] and replace the value of arr[i] with (arr[i] - arr[j]), th...read more

Introduction to Max-Heap

Last Updated: 23 March 2026

A Max-Heap is a Data Structure with the following properties:It is a Complete Binary Tree.The value of the root node must be the largest among all its descendant nodes, an...read more

👁 article_image

Max Heap in JavaScript

Last Updated: 23 July 2025

A max-heap is a complete binary tree in which the value in each node is greater than the values in the descendant nodes. Mapping the elements of a heap into an array is tr...read more

👁 article_image

Merge Two Binary Max Heaps

Last Updated: 23 July 2025

Given two binary max heaps, the task is to merge the given heaps to form a new max heap.Examples : Input: a[] = {10, 5, 6, 2}, b[] = {12, 7, 9}Output: {12, 10, 9, 2, 5, 7,...read more

👁 article_image