← Microsoft questions

Replace zero nodes in linked list with sum of intermediate nodes

Filed under Microsoft

Given the head of a linked list, we repeatedly modify the list such that any sequence of consecutive nodes whose sum is 0 is collapsed into a single node with value 0, or more specifically, given…

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.