NVIDIA Heap (Priority Queue) Questions

14 heap (priority queue) problems asked at NVIDIA interviews

Easy (1)Medium (9)Hard (4)

Questions

Title	Difficulty	Acceptance	Frequency
Merge k Sorted Lists	Hard	58.9%	78.9%
Last Stone Weight	Easy	66.3%	75.1%
Sliding Window Maximum	Hard	48.5%	57.3%
Top K Frequent Elements	Medium	65.9%	57.3%
Max Sum of a Pair With Equal Sum of Digits	Medium	66.0%	57.3%
Remove Stones to Minimize the Total	Medium	65.5%	52.3%
Maximum Number of Events That Can Be Attended	Medium	38.9%	52.3%
Find Median from Data Stream	Hard	54.2%	45.8%
Network Delay Time	Medium	59.8%	36.9%
Kth Largest Element in an Array	Medium	68.8%	36.9%
Task Scheduler	Medium	62.7%	36.9%
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit	Medium	57.4%	36.9%
The Skyline Problem	Hard	45.0%	36.9%
Find K Closest Elements	Medium	49.4%	36.9%

Showing 14 questions