# Leetcode Reverse Linked List problem solution

In this Leetcode Reverse Linked List problem solution, we have given the head of a singly linked list, reverse the list, and return the reversed list.

## Problem solution in Python.

```def reverseList(self, current):
"""
:rtype: ListNode
"""
prev=None
while current:
curre_new = current.next
current.next=prev
prev = current
current = curre_new
return prev
```

## Problem solution in Java.

```class Solution {
return null;
ListNode first = null;
ListNode third = sec.next;
while(third != null) {
ListNode temp = third.next;
sec.next = first;
third.next = sec;
first = sec;
sec = third;
third = temp;
}
return sec;
}
}
```

## Problem solution in C++.

```class Solution {
public:
ListNode *aPrev = NULL;
ListNode *aNext = NULL;
while (aNode != NULL) {
aNext = aNode->next;
aNode->next = aPrev;
aPrev = aNode;
aNode = aNext;
}
return aPrev;

}
};
```

## Problem solution in C.

```typedef struct ListNode NODE;

return NULL;
int i=0;
NODE *previous,*current;
previous=(NODE *) malloc(sizeof(NODE));
current=(NODE *) malloc(sizeof(NODE));
current->next=previous;
if(i==0)
previous->next=NULL;
previous=current;
i++;
}

return current;
}
```