Given the heads of two sorted linked lists, write a recursive function to return a new linked list representing their intersection, using no extra space (excluding recursive call stack memory).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.