Heap (Priority Queue)

Medium | Array, Greedy, Sorting, Heap (Priority Queue), Matrix

Medium | Array, Sorting, Heap (Priority Queue)

Hard | Array, Hash Table, Math, Dynamic Programming, Sliding Window, Heap (Priority Queue)

Easy | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set

Hard | Array, Hash Table, Linked List, Heap (Priority Queue), Simulation, Doubly-Linked List, Ordered Set

Hard | Array, Bit Manipulation, Graph Theory, Heap (Priority Queue), Shortest Path, Bitmask

Medium | Graph Theory, Heap (Priority Queue), Shortest Path

Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Heap (Priority Queue), Ordered Set

Hard | Array, Binary Search, Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Path

Medium | Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue)

Medium | Graph Theory, Heap (Priority Queue), Shortest Path

Hard | Array, Greedy, Segment Tree, Heap (Priority Queue)

Medium | Array, Greedy, Sorting, Heap (Priority Queue)

Medium | Array, Greedy, Sorting, Heap (Priority Queue)

Medium | Array, String, Greedy, Heap (Priority Queue)

Medium | Hash Table, Design, Heap (Priority Queue), Ordered Set

Medium | Array, Hash Table, Design, Heap (Priority Queue), Ordered Set

Hard | Dynamic Programming, Tree, Depth-First Search, Sorting, Heap (Priority Queue)

Easy | Array, Sorting, Heap (Priority Queue), Simulation

Hard | Array, Binary Search, Greedy, Heap (Priority Queue)