Given the head of a singly linked list where each node contains a character, traverse the list and whenever adjacent nodes contain 'D' followed by 'A', insert a new node containing 'I' between them…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.