Interview PrepHeaps & Priority Queues

0% read · 0 of 34 topics

Heaps & Priority QueuesDSA

Ordering & Selection

0% read0 of 34 topics

1. Heap Basics0/10

Kth Largest Element in an ArraySoon

Kth Smallest Element in an ArraySoon

Top K Frequent ElementsSoon

Top K Frequent WordsSoon

K Closest Points to OriginSoon

Kth Largest Element in a StreamSoon

Last Stone WeightSoon

Sort an Array Using Heap SortSoon

Connect N Ropes (Minimum Cost of Ropes)Soon

Hand of StraightsSoon

2. Top K Pattern0/2

Kth Smallest Element in a Sorted ArraySoon

Find K Pairs with Smallest SumsSoon

3. Two Heaps0/5

Find Median from Data StreamSoon

IPOSoon

Maximize CapitalSoon

Minimum Cost to Hire K WorkersSoon

Find Right IntervalSoon

4. Merge K Sorted Structures0/3

Smallest Range Covering Elements from K ListsSoon

Merge K Sorted ArraysSoon

Kth Smallest Number in M Sorted ListsSoon

5. Scheduling / Greedy + Heap0/8

Task SchedulerSoon

Meeting Rooms IISoon

Minimum Number of Meeting RoomsSoon

Single-Threaded CPUSoon

Process Tasks Using ServersSoon

Course Schedule IIISoon

Maximum Performance of a TeamSoon

Design TwitterSoon

6. Heap + Graph / Advanced0/6

Network Delay TimeSoon

Cheapest Flights Within K StopsSoon

Path With Minimum EffortSoon

Swim in Rising WaterSoon

Find the City With the Smallest Number of Neighbors at a Threshold DistanceSoon

Reorganize StringSoon

Kth Largest Element in an Array

This lesson is coming soon. Browse the rest of the Heaps & Priority Queues syllabus in the sidebar.