Pointer-based data structure problems — choose a problem to visualize
Trace digit-by-digit linked-list addition with carry propagation.
Trace slow and fast pointers until they meet or fast reaches the end.
Trace O(1) cache access by coordinating a hashmap with recency ordering.
Trace the smaller-head selection that builds one sorted linked list.
Trace the Remove Duplicates from Sorted List II pointer algorithm through each mutation.
Trace the Remove Nth Node From End of List pointer algorithm through each mutation.
Trace scanning, reversing, and reconnecting each complete k-sized group.
Trace the Reverse Linked List II pointer algorithm through each mutation.
Trace the Rotate List pointer algorithm through each mutation.