Question 1

How do you reverse a linked list?

Accepted Answer

You can reverse a linked list iteratively by maintaining three pointers: prev, current, and next. At each step, you reverse the link of the current node to point to prev, and then move all three pointers one step forward.

Question 2

How do you detect a cycle in a linked list?

Accepted Answer

Floyd's cycle-finding algorithm, also known as the 'tortoise and the hare' algorithm, is an efficient way to detect a cycle. It uses two pointers, one moving one step at a time (the tortoise) and the other moving two steps at a time (the hare). If there is a cycle, the two pointers will eventually meet.

Linked List Interview Guide

Related Algorithm Guides