Apple Interview Question
Reverse a singly linked list
Interview Answer
Anonymous
Jun 6, 2026
class Solution { public: ListNode* reverseList(ListNode* head) { if (head == nullptr || head->next == nullptr) return head; ListNode* newHead = reverseList(head->next); head->next->next = head; head->next = nullptr; return newHead; } };