โ† Microsoft questions
CodingMedium

Find intersection of two sorted linked lists recursively without extra space

Filed under Microsoft

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.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.