Given a singly linked list, reverse its second half and return the head of the modified list. If the list has an odd number of nodes, the middle node should remain part of the first half.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.