B

Basic

0 / 9

206Reverse Linked ListReversal21Merge Two Sorted ListsMerge141Linked List CycleFast & slow pointers143Reorder ListTwo Pointers + reversal19Remove Nth Node From End of ListFast & slow pointers2Add Two NumbersSimulation287Find the Duplicate NumberFloyd cycle detection92Reverse Linked List IIRange reversal138Copy List with Random PointerHashMap (interleave for O(1))

A

Design

0 / 3

622Design Circular QueueDesign146LRU CacheHashMap + DLL460LFU CacheHashMap + DLL

B

Hard

0 / 2

23Merge k Sorted ListsHeap (k-way merge)25Reverse Nodes in k-GroupGroup reversal

ViewEdit