FunctionRacerProblemsRace

Largest Adjacent Pair Sum

BeginnerLinked listsPython, JavaScript, TypeScript, Java, C++

Look at every pair of neighboring nodes and add their two values. Return the largest such sum. The list always has at least two nodes. The list is passed in as head.

Linked lists appear in the tests as the list of their values, like [1,2,3]. Each node is a ListNode with .val and .next; the class is already defined for you.

Example 1

head [1,5,2,1]
returns 7

1+5=6, 5+2=7, 2+1=3. The largest is 7.

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More Linked lists problems