Linked List

Problem Hint Notes/Pattern

Reverse a Linked List Iterative or recursive Use two pointers to
approach reverse the links one by
one. In the iterative
approach, maintain a
prev pointer and
update the next of the
current node to point to
prev. In recursion,
reverse the rest of the
list and fix the first
node.
Merge Two Sorted Use a dummy node for Use two pointers to
Lists simplicity traverse both lists.
Compare current values
of both lists and
append the smaller one
to the result list. A
dummy node helps
avoid edge cases.
Linked List Cycle Fast and slow pointers Use two pointers: slow
moves by one step, fast
moves by two. If there
is a cycle, they will
meet. If the fast pointer
reaches null, there is no
cycle.
Remove N-th Node Two-pass or one-pass In one pass, use two
from End of List approach pointers. First pointer
moves n steps ahead,
then both move
simultaneously until the
first pointer reaches the
end. The second
pointer will be at the
node to remove.
Reorder List Split, reverse, and Split the list in half
merge using fast and slow
pointers. Reverse the
second half, and then
merge it with the first
 end. The second
pointer will be at the
node to remove.
Reorder List Split, reverse, and Split the list in half
merge using fast and slow
pointers. Reverse the
second half, and then
merge it with the first
half.
Palindrome Linked Reverse the second Use fast and slow
List half pointers to find the
middle, then reverse
the second half.
Compare the first half
with the reversed
second half for
palindrome checking.
Intersection of Two Length difference trick First, calculate the
Linked Lists lengths of both lists.
Move the pointer of the
longer list ahead by the
difference in lengths.
Then move both
pointers one step at a
time to find the
intersection.
Add Two Numbers Handle carry like digit Start from the heads of
addition both lists, and simulate
the addition of digits
with carry. Keep track
of the carry and
append nodes to the
result list.
Copy List with HashMap for extra Use a HashMap to map
Random Pointer memory or optimize original nodes to their
with weaving copies. For the
optimized solution,
weave the original list
and the copied list
together and then
unweave them.
Flatten a Multilevel Use a stack to track Use a stack to handle
Doubly Linked List nodes nodes with children.
When you encounter a
child node, push the
next node onto the
 and the copied list
together and then
unweave them.
Flatten a Multilevel Use a stack to track Use a stack to handle
Doubly Linked List nodes nodes with children.
When you encounter a
child node, push the
next node onto the
stack and start
processing the child
list. After finishing the
child list, continue with
the original list.