You are viewing a single comment's thread. Return to all comments →
This problem is easy with a priority queue, not with a heap. I think this problem should be moved to another section or its difficulty should be increased.
I agree that this probably shouldn't be categorized as 'easy'. Heaps are the standard way to implement a priority queue. The easy approach would be to use a library, and the more challenging path is to create a heap yourself.
I agree this should be under 'EASY' category.