Given a singly linked list, swap every two adjacent nodes and return the head of the modified list. You must solve the problem by actually swapping the nodes (changing pointers), not by merely…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.