Pairwise sum of adjacent nodes

Sum each adjacent pair; keep a lone last node as-is.

linked-list lists pointers

Implement `pairwise_sum(values: list[int]) -> list[int]` summing pairs left-to-right.

Constraints

0 ≤ list lengths ≤ 10_000 unless noted.

Example

>>> pairwise_sum(...)
# see tests

22 points ~20 min

Recent Submissions

No submissions yet — hit Run Tests to try!

Hints

Work on paper with a tiny list first.

Match the function signature exactly.

Test Results

Press Ctrl+Enter or click Run Tests to execute your code.