Qiutong Songqiutongs.hashnode.dev·Dec 11, 2022Heap Techniques (1)Difficulty: ★★☆☆☆ Usability: ★★★☆☆ Problem Pattern Given an unordered set of data that is comparable, find the top K elements. Thinking Process Sorting the whole set is the most straightforward way which takes O(NlogN) time. But it is overkill since ...Algorithm InterviewalgorithmsAdd a thoughtful commentNo comments yetBe the first to start the conversation.
