LeetCode 1046: Last Stone Weight
A clear explanation of simulating stone smashing to find the last remaining weight using a max heap.
Tag
Priority-Queue
15 notes
LeetCode 373: Find K Pairs with Smallest Sums
A clear explanation of finding the k smallest pair sums from two sorted arrays using a min heap and best-first search.
LeetCode 218: The Skyline Problem
A clear explanation of computing the skyline formed by buildings using sweep line and a max-heap.
LeetCode 23: Merge k Sorted Lists
A detailed explanation of merging k sorted linked lists using a min heap.
LeetCode 871: Minimum Number of Refueling Stops
A clear explanation of minimizing refueling stops using a greedy max heap over reachable stations.
LeetCode 786: K-th Smallest Prime Fraction
A clear explanation of finding the kth smallest fraction from a sorted array using a min-heap.
LeetCode 778: Swim in Rising Water
A clear explanation of finding the minimum time to reach the bottom-right cell using a priority queue and minimax path reasoning.
LeetCode 703: Kth Largest Element in a Stream
A clear explanation of maintaining the kth largest element in a stream using a fixed-size min heap.
LeetCode 632: Smallest Range Covering Elements from K Lists
A heap-based solution for finding the smallest range that contains at least one number from each sorted list.
LeetCode 502: IPO
A clear explanation of maximizing capital by selecting at most k projects using sorting and a max heap.
LeetCode 407: Trapping Rain Water II
A clear explanation of trapping rain water in a 2D elevation map using a min heap and boundary expansion.
LeetCode 355: Design Twitter
A clear explanation of implementing a simplified Twitter using hash maps, sets, timestamps, and a heap.
LeetCode 295: Find Median from Data Stream
A two-heap data structure for adding numbers from a stream and returning the current median in constant time.
LeetCode 253: Meeting Rooms II
A clear explanation of the Meeting Rooms II problem using a min heap to track active meeting end times.
1.5 Heaps and Priority Queues
Binary, d-ary, Fibonacci, pairing, soft heaps, double-ended structures, tournament trees, and concurrent priority queue designs.