← Flipkart questions

Max sum path in two intersecting linked lists

Filed under Flipkart

Given two sorted linked lists that intersect at some node, find the path with the maximum sum. You can switch from one list to the other at any intersection point.

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

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