Linked List

Reverse a singly linked list.

Merge two sorted linked lists.

Detect cycle in linked list.

Reorder L0→Ln→L1→Ln-1→...

Remove nth node from end.

Deep copy list with random pointers.

Add numbers as reversed linked lists.

Find duplicate in [1,n] array.

O(1) get/put LRU cache.

Merge k sorted lists into one.

Reverse nodes in k-groups.