# Status Problem Level Completes Likes 1 Heap Sort – Java Implementation Medium % 0 2 Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation Hard % 0 3 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key Hard % 0 4 Shortest Range in K-sorted Lists Hard % 1 5 Generate Maximum revenue by selling K tickets from N windows Medium % 0 6 Find the Kth Smallest/Largest Element in an Array Beginner % 0 7 Priority Queue in Data Structure Beginner % 0 8 Merge K Sorted Arrays Hard % 0 9 Binary Min-Max Heap Implementation Hard % 0 Heap Sort – Java Implementation Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key Shortest Range in K-sorted Lists Generate Maximum revenue by selling K tickets from N windows Find the Kth Smallest/Largest Element in an Array Priority Queue in Data Structure Merge K Sorted Arrays Binary Min-Max Heap Implementation 1
