Similar Topics

Web Technologies32.1K+ articles

Misc7.7K+ articles

Mathematical5.1K+ articles

Arrays4.2K+ articles

Strings2.1K+ articles

Greedy1.4K+ articles

Sorting1.1K+ articles

Dynamic Programming1.1K+ articles

Searching1.0K+ articles

Tree912+ articles

DSA / Data Structures / Heap

Heap

176+ posts

Heap Data Structure Interview Questions

Last Updated: 07 August 2026

Heap data structure interview questions are commonly asked to assess your understanding of heap operations, priority queues, heap sort, and related algorithms. This collec...read more

article_image

Python Heap Coding Practice Problems

Last Updated: 10 September 2025

This module helps us efficiently add, remove and access the smallest element in a collection. In these heapq coding practice problems, you’ll work on tasks to strengthen y...read more

Meeting Rooms - Room with Maximum Meetings

Last Updated: 17 October 2025

Given an integer n and a 2D array meetings[][], where n represents the number of classrooms numbered from 0 to n - 1, and meetings[i] = [starti, endi] represents a meeting...read more

Greedy Algorithms

Find k smallest elements in an array

Last Updated: 23 July 2025

Given an array arr[] and an integer k, the task is to find k smallest elements in the given array. Elements in the output array can be in any order.Examples:Input: arr[] =...read more

What is Min Heap?

Last Updated: 23 July 2025

Min Heap is a type of binary heap where the key at the root must be the minimum among all keys present in the binary heap. The same property must be recursively true for a...read more

article_image

What is Max Heap?

Last Updated: 23 July 2025

Max Heap is a type of binary heap where the key at the root must be the maximum among all keys present in the binary heap. The same property must be recursively true for a...read more

article_image

Rearrange Distant Barcodes

Last Updated: 23 July 2025

In a warehouse, there is a row of barcodes, where the ith barcode is barcodes[i].Rearrange the barcodes so that no two adjacent barcodes are equal. You may return any answ...read more

Heap Data Structure

Last Updated: 11 April 2026

A Heap is a complete binary tree data structure that satisfies the heap property: in a min-heap, the value of each child is greater than or equal to its parent, and in a ...read more

article_image

Types of Heap Data Structure

Last Updated: 23 January 2024

Different types of heap data structures include fundamental types like min heap and max heap, binary heap and many more. In this post, we will look into their characterist...read more

article_image

Data Structures-Heap

Binary Heap Notes for GATE Exam [2024]

Last Updated: 23 July 2025

In the GATE Exam, understanding binary heaps is like having a secret weapon. Questions might ask you to pick the right tool for a job, and heaps are often the superheroes ...read more

article_image

Minimize Range of the Array

Last Updated: 31 January 2024

Given an array A of size N. In one operation, you can select any number from the array and reduce it to a divisor greater than 1. For example, you can reduce 16 to 2, 4, 8...read more

Equalize Array Elements

Last Updated: 07 August 2026

Given an array arr[] of positive integers. In one operation, choose any two unequal elements and replace the larger element with the difference of the two elements. Repeat...read more

java-priority-queue

Find the city by using teleporters

Last Updated: 23 July 2025

Given N cities numbered 1 to N. You are initially in the 1st city. The distance between two cities i, j is |Ai - Aj|. The energy lost while traveling from one city to anot...read more

Geeks Premier League

Geeks Premier League 2023

Find the tasks completed by soldiers based on their ranks

Last Updated: 23 July 2025

Given an array ranks[] of size N denoting the ranks of soldiers and tasks[] of size M where tasks[i] represent the amount of time (in seconds) required to complete ith tas...read more

Geeks Premier League

Data Structures

Geeks Premier League 2023

Split Array Subsequences

Last Updated: 31 July 2026

Given an integer array arr[] that is sorted in increasing order and an integer k. Check whether it is possible to split arr[] into one or more subsequences such that both ...read more

Data Structures-Heap

...