LC 2

Add Two Numbers

Medium · LC 1–100

linked-listmathrecursion
Free

Candidate solution routes

Primary

Linked-List Pointer Rewiring

Free

Invariant: prev bounds the correctly processed chain and cur is the first unprocessed node; every original node belongs to exactly one side and remains reachable.

candidate confidence: 0.650 · metadata_only

How to use this page

Read the statement and constraints first, then validate recognition signals, invariant, and complexity. Candidate score is not correctness evidence.