Similar Topics

Web Technologies32.1K+ articles

DSA20.5K+ articles

Mathematical5.1K+ articles

Arrays4.2K+ articles

Greedy1.4K+ articles

Sorting1.1K+ articles

Heap177+ articles

priority-queue149+ articles

cpp-priority-queue53+ articles

Data Structures-Heap25+ articles

min-heap

25 posts

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

Kth Largest Element in an Array

Last Updated: 29 October 2025

Given an integer array arr[] of size n elements and a positive integer K, the task is to return the kth largest element in the given array (not the Kth distinct element).E...read more

Maximum number of elements that can be taken

Last Updated: 23 December 2023

Given an array of N integers. Each i'th element increases your sum by a[i], where a[i] can be negative which may decrease your sum. You start with sum=0 and iterate the ar...read more

Greedy Algorithms

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

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

Introduction to Min-Heap

Last Updated: 03 April 2026

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

article_image

Heap in JavaScript

Last Updated: 23 July 2025

A Heap is a special Tree-based Data Structure that has the following properties.It is a complete Complete Binary Tree.It either follows max heap or min heap property.A Min...read more

article_image

Min Heap meaning in DSA

Last Updated: 23 July 2025

A min heap is a binary tree-based data structure where the value of each node is less than or equal to its child nodes.In other words, the root node is always the minimum ...read more

article_image

Definitions and Meanings

Introduction to Block Sort

Last Updated: 03 December 2024

Block sort is a sorting algorithm that sorts an array by dividing it into blocks of fixed size, sorting each block individually, and then merging the sorted blocks back in...read more

Data Structures

Sum of first M fractions formed from Array of primes

Last Updated: 23 July 2025

Given an integer M and a sorted integer array arr[] of length N containing 1 and N-1 prime numbers, each appearing just once, the task is to find the sum of M smallest pos...read more

cpp-priority-queue

Shortest distance between given nodes in a bidirectional weighted graph by removing any K edges

Last Updated: 23 July 2025

Given a positive integer K and a weighted undirected connected graph of N nodes and E edges as an array Edges[] of the type {u, v, W} representing the edges between Node u...read more

article_image

Graph Traversals

Maximize array sum by replacing at most L elements to R for Q queries

Last Updated: 23 July 2025

Given an array arr[] consisting of N integers and an array Query[][] consisting of M pairs of the type {L, R}, the task is to find the maximum sum of the array by performi...read more

array-range-queries

Maximize count of increasing triplets from any permutation of given 3 Arrays

Last Updated: 23 July 2025

Given three arrays X[], Y[], and Z[] each consisting of N integers, the task is to find the maximum number of triplets (X[i], Y[i], Z[i]) such that (X[i] Y[i] Z[i]) for ...read more

Maximum amount of capital required for selecting at most K projects

Last Updated: 23 May 2026

Given an integer N, representing number of projects, two arrays P[] and C[], consisting of N integers, and two integers W and K where, W is the initial capital amount, P[i...read more

cpp-priority-queue

Find the Platform at which the given Train arrives

Last Updated: 23 July 2025

Given a 2D array arr[][3] consisting of information of N trains where arr[i][0] is the train number, arr[i][1] is the arrival time, and arr[i][2] is the duration of stoppa...read more

1 2