FunctionRacerProblemsRace

Keep Record Highs

EasyLinked listsPython, JavaScript, TypeScript, Java, C++

Keep a node only if its value is strictly greater than every value before it in the list (the head always counts). Drop all other nodes and return the new head. 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 [3,1,4,4,2,6]
returns [3,4,6]

3, 4 and 6 set new records; the second 4 only ties.

Example 2

head [5,4,3]
returns [5]

Only the head.

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