← Amazon questions

Maximum sum linked list from two sorted lists

Filed under Amazon

Given two sorted linked lists that intersect at some nodes, construct a new linked list by traversing both and choosing the path at each intersection that yields the maximum sum.

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 Amazon questions

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