Heap problems

25 Heap DSA practice problems on CampusCode, each with statement, examples and constraints.

• 355. Merge K Sorted Linked Lists Medium Linked List
• 394. Merge K Sorted Lists (Optimal — Min Heap) Hard Linked List
• 404. Merge M Sorted Lists of Variable Size Hard Linked List
• 413. Find Kth Largest Using a Linked List Min-Heap Hard Linked List
• 521. Maximum Number of Events That Can Be Attended Medium Binary Search
• 523. Course Schedule III (Greedy + Heap) Medium Binary Search
• 527. Kth Smallest Element in a Sorted Matrix Hard Binary Search
• 537. Minimum Interval to Include Each Query Hard Binary Search
• 540. Find Kth Smallest Sum of a Matrix with Sorted Rows Hard Binary Search
• 545. Minimum Cost to Hire K Workers (Scaled) Hard Binary Search
• 553. Minimum Number of Refueling Stops Hard Binary Search
• 560. Minimize Deviation in Array Hard Binary Search
• 677. Maximal Score After Applying K Operations Hard Stack
• 926. Closest BST Values II — K Closest Medium Trees
• 957. Kth Smallest Element in a Sorted Matrix Hard Trees
• 1026. Dijkstra's Shortest Path Algorithm Medium Graphs
• 1030. Dijkstra on Grid — Minimum Cost Path Medium Graphs
• 1031. Network Delay Time (Dijkstra) Medium Graphs
• 1033. Path with Minimum Effort Medium Graphs
• 1034. Swim in Rising Water (Dijkstra / BS) Medium Graphs
• 1037. Minimum Spanning Tree — Prim's Algorithm Medium Graphs
• 1070. Reachable Nodes in Subdivided Graph Medium Graphs
• 1074. Minimum Weighted Sum to All Reachable Nodes Medium Graphs
• 1076. Dijkstra with State — Minimum Cost with K Stops Hard Graphs
• 1097. Number of Restricted Paths Hard Graphs