Grokking Data Structures & Algorithms for Coding Interviews
Vote

0% completed

​

Problem 1: Reverse Linked List (easy)

Problem Statement:

Given the head of a singly linked list, your task is to reverse the list and return its head. The singly linked list has nodes, and each node contains an integer and a pointer to the next node. The last node in the list points to null, indicating the end of the list.

Examples

Example 1:

  • Input: [3, 5, 2]
  • Expected Output: [2, 5, 3]
  • Justification: Reversing the list [3, 5, 2] gives us [2, 5, 3].

Example 2:

  • Input: [7]
  • Expected Output: [7]

.....

.....

.....

Like the course? Get enrolled and start learning!
Sandeep Gattani

Sandeep Gattani

· 3 years ago

Test case seems to be incorrect. Expected result shows unreveresed linked list.

Even with the code in provided solution, the code says incorrect result upon submitting.

Show 1 reply
V

Viktor

· 3 months ago

It would be nice to stress that the task assumes reversing the linked list in-place. Otherwise, it's tempting to create a new reversed linked list, making a trivial single pass over the existing one.