Given the head of a singly linked list, reverse the list and return the new head. Each node contains an integer value and a next pointer. You must reverse the links in-place rather than creating a second list.
Constraints
0 <= number of nodes <= 5000
-5000 <= Node.val <= 5000
The list is singly linked
Function Signature
defreverse_linked_list(head):
Interviewer
Your question is Reverse a Singly Linked List. Start with the requirements in the Question tab.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
