Open in app
Sign inGet started

Heap / Linked List

[Leetcode] Top K Frequent Elements

[Leetcode] Top K Frequent Elements

Use partial sorting to outperform O(nlogn).
Go to the profile of PHIL
PHIL
[Leetcode] Merge Two Sorted Lists

[Leetcode] Merge Two Sorted Lists

A classic linked list problem to practice switching attributes from nodes to nodes.
Go to the profile of PHIL
PHIL
[Leetcode] Sort List

[Leetcode] Sort List

The extension of Merge Two Sorted Lists. Linked lists make problem tricker. Still, the concept is the same as merge sort so…
Go to the profile of PHIL
PHIL
[Leetcode] Swap Nodes in Pairs

[Leetcode] Swap Nodes in Pairs

Use recursion to decrease and conquer the problem.
Go to the profile of PHIL
PHIL

[Leetcode] Merge k Sorted Lists

An extension of Merge Two Sorted Lists. Use heap to keep next pair (val, index) at the top. Shift head to next of target list for directly…
Go to the profile of PHIL
PHIL
[Leetcode] Reverse Nodes in k-Group

[Leetcode] Reverse Nodes in k-Group

An extension of Reverse Linked List. The essence is leveraging decrease and conquer.
Go to the profile of PHIL
PHIL
[Leetcode] Remove Nth Node From End of List

[Leetcode] Remove Nth Node From End of List

A good practice for slow fast pointers.
Go to the profile of PHIL
PHIL
[Leetcode] K Closest Points to Origin

[Leetcode] K Closest Points to Origin

heapq api in python makes this problem trivial.
Go to the profile of PHIL
PHIL

[Leetcode] Find Median from Data Stream

A very intricate usage of heap.
Go to the profile of PHIL
PHIL

[Leetcode] Find K Pairs with Smallest Sums

Perhaps the most counter-intuitive heap problem I’ve done so far.
Go to the profile of PHIL
PHIL
About Coding MemoLatest StoriesArchiveAbout MediumTermsPrivacyTeams