Largest Value
Return the largest value in a non-empty linked list. 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,9,2]
returns 9
9 is the biggest.
Example 2
head [-7,-3,-9]
returns -3
All negative: -3 is the biggest.
Constraints
1 <= number of nodes <= 100-100 <= Node.val <= 100
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.
More Linked lists problems
- Last Node's ValueBeginner
- Linked List to TextBeginner
- Longest Run of Equal ValuesBeginner
- One Bubble PassBeginner
- Running Totals ListBeginner
- Second Largest ValueBeginner
- Sum of the First KBeginner
- Sum of the ValuesBeginner