Given a singly linked list and a number K, swap the Kth node from the start with the Kth node from the end, handling all edge cases including lists of lesser size.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.